YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:05:33,228 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:05:33,230 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:05:33,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:05:33,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:05:33,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:05:33,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:05:33,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:05:33,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:05:33,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:05:33,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:05:33,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:05:33,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:05:33,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:05:33,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:05:33,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:05:33,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:05:33,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:05:33,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:05:33,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:05:33,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:05:33,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:05:33,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:05:33,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:05:33,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:05:33,265 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:05:33,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:05:33,266 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:05:33,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:05:33,267 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:05:33,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:05:33,269 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:05:33,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:05:33,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:05:33,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:05:33,271 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:05:33,271 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:05:33,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:05:33,273 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:05:33,273 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:05:33,288 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:05:33,289 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:05:33,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:05:33,290 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:05:33,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:05:33,291 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:05:33,291 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:05:33,291 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:05:33,291 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:05:33,291 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:05:33,291 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:05:33,292 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:05:33,292 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:05:33,292 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:05:33,292 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:05:33,292 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:05:33,292 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:05:33,293 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:05:33,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:05:33,293 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:05:33,293 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:05:33,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:05:33,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:05:33,294 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:05:33,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:05:33,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:05:33,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:05:33,294 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:05:33,295 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:05:33,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:05:33,340 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:05:33,344 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:05:33,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:05:33,347 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:05:33,348 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:05:34,353 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/7f7f3dd27a9149e5842b0915919aaffd/FLAG6861f622b !SESSION 2020-06-22 09:05:24.665 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 09:05:34.523 !MESSAGE Indexed 'FLAG6861f622b' (0 sources, 0 headers) in 0.005 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 09:05:34,750 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:05:34,751 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:05:34,751 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:05:34,758 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/7f7f3dd27a9149e5842b0915919aaffd/FLAG6861f622b [2020-06-22 09:05:34,787 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/7f7f3dd27a9149e5842b0915919aaffd [2020-06-22 09:05:34,800 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:05:34,801 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:05:34,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:05:34,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:05:34,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:05:34,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:05:34" (1/1) ... [2020-06-22 09:05:34,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793f17be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:34, skipping insertion in model container [2020-06-22 09:05:34,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:05:34" (1/1) ... [2020-06-22 09:05:34,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:05:34,838 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:05:35,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:05:35,068 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:05:35,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:05:35,102 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:05:35,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35 WrapperNode [2020-06-22 09:05:35,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:05:35,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:05:35,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:05:35,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:05:35,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:05:35,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:05:35,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:05:35,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:05:35,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:05:35,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:05:35,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:05:35,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:05:35,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:05:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:05:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:05:35,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:05:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:05:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:05:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:05:35,495 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:05:35,496 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2020-06-22 09:05:35,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:05:35 BoogieIcfgContainer [2020-06-22 09:05:35,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:05:35,498 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:05:35,498 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:05:35,503 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:05:35,504 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:05:35" (1/1) ... [2020-06-22 09:05:35,522 INFO L313 BlockEncoder]: Initial Icfg 34 locations, 40 edges [2020-06-22 09:05:35,523 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:05:35,524 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:05:35,524 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:05:35,525 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:05:35,526 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:05:35,527 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:05:35,527 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:05:35,551 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:05:35,576 INFO L200 BlockEncoder]: SBE split 13 edges [2020-06-22 09:05:35,581 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 09:05:35,583 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:05:35,617 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-06-22 09:05:35,619 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:05:35,621 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:05:35,621 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:05:35,621 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:05:35,622 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:05:35,622 INFO L313 BlockEncoder]: Encoded RCFG 24 locations, 40 edges [2020-06-22 09:05:35,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:05:35 BasicIcfg [2020-06-22 09:05:35,623 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:05:35,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:05:35,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:05:35,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:05:35,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:05:34" (1/4) ... [2020-06-22 09:05:35,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7194de7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:05:35, skipping insertion in model container [2020-06-22 09:05:35,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (2/4) ... [2020-06-22 09:05:35,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7194de7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:05:35, skipping insertion in model container [2020-06-22 09:05:35,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:05:35" (3/4) ... [2020-06-22 09:05:35,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7194de7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:05:35, skipping insertion in model container [2020-06-22 09:05:35,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:05:35" (4/4) ... [2020-06-22 09:05:35,634 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:05:35,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:05:35,652 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-06-22 09:05:35,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-06-22 09:05:35,697 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:05:35,697 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:05:35,698 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:05:35,698 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:05:35,698 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:05:35,698 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:05:35,698 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:05:35,698 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:05:35,699 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:05:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-06-22 09:05:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:05:35,719 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:05:35,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:05:35,720 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:05:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:35,725 INFO L82 PathProgramCache]: Analyzing trace with hash 174224749, now seen corresponding path program 1 times [2020-06-22 09:05:35,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:35,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:35,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:35,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:35,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:35,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:05:35,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:05:35,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:05:35,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:05:35,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:05:35,915 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-06-22 09:05:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:05:36,026 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2020-06-22 09:05:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:05:36,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:05:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:05:36,039 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:05:36,040 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:05:36,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:05:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:05:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:05:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:05:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 09:05:36,078 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 5 [2020-06-22 09:05:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:05:36,078 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:05:36,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:05:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-06-22 09:05:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:05:36,079 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:05:36,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:05:36,079 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:05:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash 174224751, now seen corresponding path program 1 times [2020-06-22 09:05:36,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:36,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:36,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:05:36,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:05:36,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:05:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:05:36,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:05:36,152 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 4 states. [2020-06-22 09:05:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:05:36,228 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-06-22 09:05:36,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:05:36,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:05:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:05:36,230 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:05:36,230 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:05:36,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:05:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:05:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:05:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:05:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-06-22 09:05:36,235 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 5 [2020-06-22 09:05:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:05:36,235 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-06-22 09:05:36,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:05:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-06-22 09:05:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:05:36,236 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:05:36,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:05:36,236 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:05:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:36,236 INFO L82 PathProgramCache]: Analyzing trace with hash 174224752, now seen corresponding path program 1 times [2020-06-22 09:05:36,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:36,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:36,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:05:36,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:05:36,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:05:36,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:05:36,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:05:36,272 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. [2020-06-22 09:05:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:05:36,345 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-06-22 09:05:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:05:36,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:05:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:05:36,346 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:05:36,346 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:05:36,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:05:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:05:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:05:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:05:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-06-22 09:05:36,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 5 [2020-06-22 09:05:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:05:36,352 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-06-22 09:05:36,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:05:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-06-22 09:05:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:05:36,353 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:05:36,353 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:05:36,354 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:05:36,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 807367607, now seen corresponding path program 1 times [2020-06-22 09:05:36,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:36,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:36,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:05:36,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:05:36,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:05:36,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:05:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:05:36,394 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2020-06-22 09:05:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:05:36,450 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-06-22 09:05:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:05:36,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 09:05:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:05:36,451 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:05:36,451 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:05:36,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:05:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:05:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:05:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:05:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:05:36,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-06-22 09:05:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:05:36,453 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:05:36,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:05:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:05:36,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:05:36,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:05:36,603 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-06-22 09:05:36,603 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 10 19) no Hoare annotation was computed. [2020-06-22 09:05:36,604 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2020-06-22 09:05:36,604 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_test_fun_~a.base)) (.cse1 (* 4 ULTIMATE.start_test_fun_~i~0))) (and (<= (* 4 ULTIMATE.start_test_fun_~N) .cse0) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= (+ .cse1 4) .cse0) (<= 0 (+ .cse1 ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base)))) [2020-06-22 09:05:36,604 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:05:36,605 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:05:36,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:05:36,606 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-06-22 09:05:36,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:05:36,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:05:36,606 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 19) the Hoare annotation is: (and (<= (* 4 ULTIMATE.start_test_fun_~N) (select |#length| ULTIMATE.start_test_fun_~a.base)) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= 0 (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) [2020-06-22 09:05:36,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:05:36,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:05:36,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:05:36,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:05:36,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:05:36,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:05:36,607 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:05:36,616 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:36,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:36,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:36,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:36,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:36,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:36,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:05:36 BasicIcfg [2020-06-22 09:05:36,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:05:36,628 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:05:36,628 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:05:36,632 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:05:36,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:05:36,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:05:34" (1/5) ... [2020-06-22 09:05:36,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41a48366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:05:36, skipping insertion in model container [2020-06-22 09:05:36,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:05:36,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:05:35" (2/5) ... [2020-06-22 09:05:36,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41a48366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:05:36, skipping insertion in model container [2020-06-22 09:05:36,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:05:36,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:05:35" (3/5) ... [2020-06-22 09:05:36,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41a48366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:05:36, skipping insertion in model container [2020-06-22 09:05:36,635 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:05:36,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:05:35" (4/5) ... [2020-06-22 09:05:36,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41a48366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:05:36, skipping insertion in model container [2020-06-22 09:05:36,635 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:05:36,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:05:36" (5/5) ... [2020-06-22 09:05:36,637 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:05:36,659 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:05:36,659 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:05:36,659 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:05:36,659 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:05:36,659 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:05:36,660 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:05:36,660 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:05:36,660 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:05:36,660 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:05:36,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-06-22 09:05:36,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:05:36,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:05:36,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:05:36,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:05:36,674 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:05:36,674 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:05:36,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-06-22 09:05:36,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:05:36,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:05:36,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:05:36,677 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:05:36,677 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:05:36,683 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 23#L24true [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 18#L24-2true [129] L24-2-->L10-3: Formula: (and (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 9#L10-3true [2020-06-22 09:05:36,684 INFO L796 eck$LassoCheckResult]: Loop: 9#L10-3true [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 12#L11-3true [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 15#L11-1true [118] L11-1-->L15-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 22#L15-2true [106] L15-2-->L15: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~a.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 3#L15true [159] L15-->L10-3: Formula: (and (= (+ v_ULTIMATE.start_test_fun_~i~0_25 1) v_ULTIMATE.start_test_fun_~i~0_24) (<= |v_ULTIMATE.start_test_fun_#t~mem5_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_24} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 9#L10-3true [2020-06-22 09:05:36,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash 181355, now seen corresponding path program 1 times [2020-06-22 09:05:36,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:36,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:36,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:36,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash 120621438, now seen corresponding path program 1 times [2020-06-22 09:05:36,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:36,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:36,736 INFO L82 PathProgramCache]: Analyzing trace with hash -483788972, now seen corresponding path program 1 times [2020-06-22 09:05:36,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:36,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:36,973 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:05:36,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:05:36,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:05:36,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:05:36,974 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:05:36,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:05:36,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:05:36,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:05:36,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:05:36,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:05:36,975 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:05:36,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:37,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:05:37,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:05:37,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:37,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:37,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:37,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:37,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:37,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:37,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:37,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:37,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:37,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:37,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:37,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:37,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:37,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:37,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:37,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:37,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:37,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:37,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:37,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:37,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:37,588 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:05:37,624 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-06-22 09:05:37,624 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:05:37,627 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:05:37,629 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:05:37,629 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:05:37,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2020-06-22 09:05:37,638 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 09:05:37,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:37,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:05:37,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:37,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:05:37,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:37,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:05:37,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:37,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:05:37,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:37,843 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 09:05:37,846 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 09:05:37,847 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states. Second operand 4 states. [2020-06-22 09:05:38,048 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states.. Second operand 4 states. Result 78 states and 115 transitions. Complement of second has 7 states. [2020-06-22 09:05:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 09:05:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 09:05:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2020-06-22 09:05:38,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 3 letters. Loop has 5 letters. [2020-06-22 09:05:38,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:38,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 8 letters. Loop has 5 letters. [2020-06-22 09:05:38,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:38,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 3 letters. Loop has 10 letters. [2020-06-22 09:05:38,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:38,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 115 transitions. [2020-06-22 09:05:38,066 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2020-06-22 09:05:38,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 32 states and 41 transitions. [2020-06-22 09:05:38,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 09:05:38,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 09:05:38,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2020-06-22 09:05:38,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:05:38,069 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-06-22 09:05:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2020-06-22 09:05:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-06-22 09:05:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:05:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-06-22 09:05:38,073 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-06-22 09:05:38,073 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-06-22 09:05:38,073 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:05:38,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-06-22 09:05:38,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2020-06-22 09:05:38,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:05:38,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:05:38,074 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:05:38,075 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:05:38,075 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 211#L24 [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 212#L24-2 [128] L24-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 213#L10-3 [2020-06-22 09:05:38,075 INFO L796 eck$LassoCheckResult]: Loop: 213#L10-3 [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 216#L11-3 [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 197#L11-1 [118] L11-1-->L15-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 199#L15-2 [106] L15-2-->L15: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~a.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 218#L15 [159] L15-->L10-3: Formula: (and (= (+ v_ULTIMATE.start_test_fun_~i~0_25 1) v_ULTIMATE.start_test_fun_~i~0_24) (<= |v_ULTIMATE.start_test_fun_#t~mem5_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_24} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 213#L10-3 [2020-06-22 09:05:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 181354, now seen corresponding path program 1 times [2020-06-22 09:05:38,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:38,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 120621438, now seen corresponding path program 2 times [2020-06-22 09:05:38,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:38,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:38,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash -512418123, now seen corresponding path program 1 times [2020-06-22 09:05:38,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:38,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:05:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,260 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:05:38,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:05:38,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:05:38,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:05:38,261 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:05:38,261 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:05:38,261 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:05:38,261 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:05:38,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:05:38,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:05:38,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:05:38,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:38,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:05:38,638 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:05:38,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:38,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:38,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:38,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:38,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:38,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:38,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:38,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:38,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:38,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:38,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:38,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:38,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:38,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:38,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:38,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:38,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:38,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:38,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:38,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:38,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:38,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:38,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:38,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:38,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:38,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:38,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:38,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:38,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:38,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:38,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:05:38,716 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 09:05:38,716 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:05:38,717 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:05:38,718 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:05:38,718 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:05:38,718 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2020-06-22 09:05:38,726 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 09:05:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:38,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:05:38,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:38,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:05:38,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:38,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:05:38,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:38,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:05:38,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:38,851 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 09:05:38,851 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 09:05:38,851 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-06-22 09:05:38,889 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 40 states and 52 transitions. Complement of second has 4 states. [2020-06-22 09:05:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 09:05:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:05:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-06-22 09:05:38,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 3 letters. Loop has 5 letters. [2020-06-22 09:05:38,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:38,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 5 letters. [2020-06-22 09:05:38,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:38,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 3 letters. Loop has 10 letters. [2020-06-22 09:05:38,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:38,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2020-06-22 09:05:38,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-06-22 09:05:38,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 52 transitions. [2020-06-22 09:05:38,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 09:05:38,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 09:05:38,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2020-06-22 09:05:38,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:05:38,897 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2020-06-22 09:05:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2020-06-22 09:05:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2020-06-22 09:05:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:05:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2020-06-22 09:05:38,899 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-06-22 09:05:38,900 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-06-22 09:05:38,900 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:05:38,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-06-22 09:05:38,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 09:05:38,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:05:38,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:05:38,901 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:05:38,901 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:05:38,901 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 363#L24 [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 364#L24-2 [129] L24-2-->L10-3: Formula: (and (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 365#L10-3 [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 351#L11-3 [2020-06-22 09:05:38,902 INFO L796 eck$LassoCheckResult]: Loop: 351#L11-3 [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 354#L11-1 [101] L11-1-->L12: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem1_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 355#L12 [158] L12-->L12-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_23))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_15))) (and (= (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~a.base_21) .cse0) |v_ULTIMATE.start_test_fun_#t~mem2_5|) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~a.base_21) 1) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_15 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~a.base_21)) (= |v_ULTIMATE.start_test_fun_#t~post3_5| |v_ULTIMATE.start_test_fun_#t~mem2_5|) (<= 0 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_15, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_21, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_23} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_15, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_21, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_23} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~post3] 350#L12-2 [160] L12-2-->L11-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_26))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_test_fun_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~a.base_22) .cse1 (+ |v_ULTIMATE.start_test_fun_#t~post3_7| 1))) |v_#memory_int_10|) (<= 0 .cse1) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~a.base_22) 1) (= v_ULTIMATE.start_test_fun_~neg~0_5 (+ v_ULTIMATE.start_test_fun_~neg~0_6 1))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_16, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_22, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_6, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_7|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_16, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_22, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_5, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_6|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_4|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~post4, #memory_int] 351#L11-3 [2020-06-22 09:05:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:38,902 INFO L82 PathProgramCache]: Analyzing trace with hash 5622102, now seen corresponding path program 1 times [2020-06-22 09:05:38,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:38,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:38,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:38,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 3319547, now seen corresponding path program 1 times [2020-06-22 09:05:38,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:38,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash -483803696, now seen corresponding path program 1 times [2020-06-22 09:05:38,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:38,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:38,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:39,111 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-06-22 09:05:39,159 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:05:39,159 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:05:39,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:05:39,159 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:05:39,159 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:05:39,159 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:05:39,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:05:39,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:05:39,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:05:39,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:05:39,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:05:39,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:39,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:05:39,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:05:39,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:39,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:39,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:39,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:39,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:39,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:39,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:39,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:39,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:39,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:39,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:39,665 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:05:39,667 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:05:39,668 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:05:39,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:05:39,669 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:05:39,669 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:05:39,669 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3 Supporting invariants [] [2020-06-22 09:05:39,688 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 09:05:39,689 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:05:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:39,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:05:39,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:39,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:05:39,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:39,827 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:05:39,827 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 09:05:39,827 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 09:05:39,827 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 09:05:39,903 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 44 states and 53 transitions. Complement of second has 10 states. [2020-06-22 09:05:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 09:05:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:05:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-06-22 09:05:39,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 09:05:39,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:39,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 09:05:39,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:39,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 09:05:39,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:39,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 53 transitions. [2020-06-22 09:05:39,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:05:39,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 32 states and 41 transitions. [2020-06-22 09:05:39,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:05:39,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 09:05:39,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2020-06-22 09:05:39,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:05:39,911 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-06-22 09:05:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2020-06-22 09:05:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2020-06-22 09:05:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:05:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-06-22 09:05:39,914 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-06-22 09:05:39,914 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-06-22 09:05:39,914 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:05:39,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2020-06-22 09:05:39,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:05:39,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:05:39,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:05:39,915 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:05:39,915 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:05:39,916 INFO L794 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 498#L24 [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 499#L24-2 [129] L24-2-->L10-3: Formula: (and (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 500#L10-3 [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 502#L11-3 [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 491#L11-1 [118] L11-1-->L15-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 492#L15-2 [2020-06-22 09:05:39,916 INFO L796 eck$LassoCheckResult]: Loop: 492#L15-2 [106] L15-2-->L15: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~a.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 484#L15 [94] L15-->L16: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 485#L16 [161] L16-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_27))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (= |v_ULTIMATE.start_test_fun_#t~mem6_5| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_23) .cse0)) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~post7_5| |v_ULTIMATE.start_test_fun_#t~mem6_5|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_23)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_23))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_23, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27} OutVars{ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_23, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#t~mem6] 495#L16-2 [162] L16-2-->L15-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18))) (and (= (+ v_ULTIMATE.start_test_fun_~pos~0_6 1) v_ULTIMATE.start_test_fun_~pos~0_5) (= (store |v_#memory_int_14| v_ULTIMATE.start_test_fun_~a.base_24 (store (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~a.base_24) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post7_7| (- 1)))) |v_#memory_int_13|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~a.base_24)) (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_7|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_6} OutVars{ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_6|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_4|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_5, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#t~post8, #memory_int, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_test_fun_#t~mem6] 492#L15-2 [2020-06-22 09:05:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1107875231, now seen corresponding path program 1 times [2020-06-22 09:05:39,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:39,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:39,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:39,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:39,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash 4176854, now seen corresponding path program 1 times [2020-06-22 09:05:39,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:39,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:39,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1064791436, now seen corresponding path program 1 times [2020-06-22 09:05:39,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:05:39,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:05:39,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:39,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:05:39,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:05:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:40,115 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-06-22 09:05:40,164 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:05:40,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:05:40,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:05:40,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:05:40,165 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:05:40,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:05:40,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:05:40,165 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:05:40,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:05:40,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:05:40,165 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:05:40,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:05:40,511 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:05:40,511 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:05:40,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:40,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:40,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:40,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:40,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:40,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:40,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:40,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:40,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:40,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:40,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:05:40,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:40,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:40,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:40,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:05:40,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:05:40,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:05:40,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:05:40,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:05:40,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:05:40,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:05:40,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:05:40,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:05:40,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:05:40,528 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:05:40,530 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:05:40,530 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:05:40,530 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:05:40,531 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:05:40,531 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:05:40,531 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_4 Supporting invariants [] [2020-06-22 09:05:40,538 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 09:05:40,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:05:40,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:05:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:40,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:05:40,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:05:40,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:05:40,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:05:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:05:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:05:40,674 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:05:40,674 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 09:05:40,674 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 09:05:40,675 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-06-22 09:05:40,735 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2020-06-22 09:05:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 09:05:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:05:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-06-22 09:05:40,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 09:05:40,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:40,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2020-06-22 09:05:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:40,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2020-06-22 09:05:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:05:40,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-06-22 09:05:40,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:05:40,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2020-06-22 09:05:40,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:05:40,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:05:40,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:05:40,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:05:40,741 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:05:40,741 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:05:40,741 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:05:40,741 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:05:40,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:05:40,741 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:05:40,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:05:40,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:05:40 BasicIcfg [2020-06-22 09:05:40,748 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:05:40,748 INFO L168 Benchmark]: Toolchain (without parser) took 5948.02 ms. Allocated memory was 645.4 MB in the beginning and 777.5 MB in the end (delta: 132.1 MB). Free memory was 554.9 MB in the beginning and 436.5 MB in the end (delta: 118.5 MB). Peak memory consumption was 250.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,749 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 645.4 MB. Free memory is still 580.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:05:40,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.33 ms. Allocated memory was 645.4 MB in the beginning and 647.5 MB in the end (delta: 2.1 MB). Free memory was 554.9 MB in the beginning and 611.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.33 ms. Allocated memory is still 647.5 MB. Free memory was 611.5 MB in the beginning and 609.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,751 INFO L168 Benchmark]: Boogie Preprocessor took 24.98 ms. Allocated memory is still 647.5 MB. Free memory was 609.3 MB in the beginning and 608.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,751 INFO L168 Benchmark]: RCFGBuilder took 328.04 ms. Allocated memory is still 647.5 MB. Free memory was 608.3 MB in the beginning and 586.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,752 INFO L168 Benchmark]: BlockEncodingV2 took 125.38 ms. Allocated memory is still 647.5 MB. Free memory was 586.2 MB in the beginning and 577.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,752 INFO L168 Benchmark]: TraceAbstraction took 1003.54 ms. Allocated memory is still 647.5 MB. Free memory was 576.6 MB in the beginning and 478.1 MB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,753 INFO L168 Benchmark]: BuchiAutomizer took 4119.82 ms. Allocated memory was 647.5 MB in the beginning and 777.5 MB in the end (delta: 130.0 MB). Free memory was 478.1 MB in the beginning and 436.5 MB in the end (delta: 41.6 MB). Peak memory consumption was 171.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:05:40,758 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 34 locations, 40 edges - StatisticsResult: Encoded RCFG 24 locations, 40 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 645.4 MB. Free memory is still 580.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 300.33 ms. Allocated memory was 645.4 MB in the beginning and 647.5 MB in the end (delta: 2.1 MB). Free memory was 554.9 MB in the beginning and 611.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.33 ms. Allocated memory is still 647.5 MB. Free memory was 611.5 MB in the beginning and 609.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.98 ms. Allocated memory is still 647.5 MB. Free memory was 609.3 MB in the beginning and 608.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 328.04 ms. Allocated memory is still 647.5 MB. Free memory was 608.3 MB in the beginning and 586.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 125.38 ms. Allocated memory is still 647.5 MB. Free memory was 586.2 MB in the beginning and 577.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1003.54 ms. Allocated memory is still 647.5 MB. Free memory was 576.6 MB in the beginning and 478.1 MB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4119.82 ms. Allocated memory was 647.5 MB in the beginning and 777.5 MB in the end (delta: 130.0 MB). Free memory was 478.1 MB in the beginning and 436.5 MB in the end (delta: 41.6 MB). Peak memory consumption was 171.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 09:05:40,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:40,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((4 * N <= unknown-#length-unknown[a] && 0 == a) && 0 <= 4 * i + a) && 1 == \valid[a] - InvariantResult [Line: 11]: Loop Invariant [2020-06-22 09:05:40,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:40,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:40,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:05:40,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((4 * N <= unknown-#length-unknown[a] && 0 == a) && 4 * i + 4 <= unknown-#length-unknown[a]) && 0 <= 4 * i + a) && 1 == \valid[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 12 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 78 SDslu, 20 SDs, 0 SdLazy, 113 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 55 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 5 locations. One nondeterministic module has affine ranking function N + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 171 SDslu, 19 SDs, 0 SdLazy, 237 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp89 ukn81 mio100 lsp56 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:05:41.002 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check