YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:42:08,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:42:08,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:42:08,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:42:08,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:42:08,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:42:08,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:42:08,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:42:08,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:42:08,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:42:08,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:42:08,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:42:08,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:42:08,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:42:08,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:42:08,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:42:08,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:42:08,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:42:08,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:42:08,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:42:08,401 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:42:08,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:42:08,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:42:08,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:42:08,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:42:08,406 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:42:08,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:42:08,407 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:42:08,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:42:08,408 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:42:08,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:42:08,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:42:08,410 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:42:08,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:42:08,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:42:08,411 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:42:08,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:42:08,412 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:42:08,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:42:08,413 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:42:08,428 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:42:08,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:42:08,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:42:08,429 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:42:08,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:42:08,430 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:42:08,430 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:42:08,430 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:42:08,430 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:42:08,430 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:42:08,431 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:42:08,431 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:42:08,431 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:42:08,431 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:42:08,431 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:42:08,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:42:08,432 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:42:08,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:42:08,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:42:08,432 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:42:08,432 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:42:08,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:42:08,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:42:08,433 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:42:08,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:42:08,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:42:08,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:42:08,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:42:08,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:42:08,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:42:08,472 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:42:08,475 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:42:08,477 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:42:08,477 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:42:08,478 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:42:08,583 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/3d7ae22712b64d2f883c21b217a16a45/FLAGcbd3dcfff [2020-06-22 10:42:08,929 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:42:08,930 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:42:08,930 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:42:08,936 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/3d7ae22712b64d2f883c21b217a16a45/FLAGcbd3dcfff [2020-06-22 10:42:09,404 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/3d7ae22712b64d2f883c21b217a16a45 [2020-06-22 10:42:09,415 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:42:09,417 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:42:09,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:42:09,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:42:09,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:42:09,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8e1c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09, skipping insertion in model container [2020-06-22 10:42:09,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:42:09,450 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:42:09,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:42:09,618 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:42:09,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:42:09,702 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:42:09,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09 WrapperNode [2020-06-22 10:42:09,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:42:09,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:42:09,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:42:09,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:42:09,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:42:09,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:42:09,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:42:09,743 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:42:09,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:42:09,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:42:09,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:42:09,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:42:09,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... No working directory specified, using /export/starexec/sandbox/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 10:42:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:42:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:42:09,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:42:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:42:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:42:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:42:10,117 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:42:10,117 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:42:10,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:10 BoogieIcfgContainer [2020-06-22 10:42:10,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:42:10,119 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:42:10,119 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:42:10,122 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:42:10,122 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:10" (1/1) ... [2020-06-22 10:42:10,139 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 56 edges [2020-06-22 10:42:10,141 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:42:10,142 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:42:10,142 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:42:10,142 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:42:10,144 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:42:10,145 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:42:10,145 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:42:10,171 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:42:10,217 INFO L200 BlockEncoder]: SBE split 28 edges [2020-06-22 10:42:10,222 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:42:10,224 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:42:10,268 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 10:42:10,270 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:42:10,272 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:42:10,272 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:42:10,273 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:42:10,273 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:42:10,274 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 80 edges [2020-06-22 10:42:10,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:10 BasicIcfg [2020-06-22 10:42:10,274 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:42:10,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:42:10,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:42:10,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:42:10,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:42:09" (1/4) ... [2020-06-22 10:42:10,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557208f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:42:10, skipping insertion in model container [2020-06-22 10:42:10,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (2/4) ... [2020-06-22 10:42:10,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557208f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:42:10, skipping insertion in model container [2020-06-22 10:42:10,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:10" (3/4) ... [2020-06-22 10:42:10,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557208f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:10, skipping insertion in model container [2020-06-22 10:42:10,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:10" (4/4) ... [2020-06-22 10:42:10,283 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:42:10,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:42:10,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-06-22 10:42:10,317 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-06-22 10:42:10,345 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:42:10,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:42:10,346 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:42:10,346 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:42:10,347 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:42:10,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:42:10,347 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:42:10,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:42:10,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:42:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-06-22 10:42:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:42:10,368 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:42:10,369 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 119551, now seen corresponding path program 1 times [2020-06-22 10:42:10,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:10,553 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 10:42:10,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:10,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:10,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:10,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:10,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,576 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-06-22 10:42:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:10,778 INFO L93 Difference]: Finished difference Result 43 states and 80 transitions. [2020-06-22 10:42:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:10,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:42:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:10,796 INFO L225 Difference]: With dead ends: 43 [2020-06-22 10:42:10,796 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 10:42:10,800 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 10:42:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 10:42:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 10:42:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 10:42:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 72 transitions. [2020-06-22 10:42:10,841 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 72 transitions. Word has length 3 [2020-06-22 10:42:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:10,842 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 72 transitions. [2020-06-22 10:42:10,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2020-06-22 10:42:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:42:10,843 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:42:10,843 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash 119553, now seen corresponding path program 1 times [2020-06-22 10:42:10,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:10,885 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 10:42:10,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:10,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:10,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,888 INFO L87 Difference]: Start difference. First operand 39 states and 72 transitions. Second operand 3 states. [2020-06-22 10:42:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,005 INFO L93 Difference]: Finished difference Result 39 states and 72 transitions. [2020-06-22 10:42:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:42:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,007 INFO L225 Difference]: With dead ends: 39 [2020-06-22 10:42:11,007 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 10:42:11,008 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 10:42:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 10:42:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 10:42:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 10:42:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2020-06-22 10:42:11,014 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 64 transitions. Word has length 3 [2020-06-22 10:42:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,014 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 64 transitions. [2020-06-22 10:42:11,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 64 transitions. [2020-06-22 10:42:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:42:11,015 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,015 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -735933566, now seen corresponding path program 1 times [2020-06-22 10:42:11,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,040 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 10:42:11,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:42:11,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,042 INFO L87 Difference]: Start difference. First operand 35 states and 64 transitions. Second operand 3 states. [2020-06-22 10:42:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,149 INFO L93 Difference]: Finished difference Result 76 states and 133 transitions. [2020-06-22 10:42:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:42:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,151 INFO L225 Difference]: With dead ends: 76 [2020-06-22 10:42:11,151 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 10:42:11,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:42:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 10:42:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-06-22 10:42:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 10:42:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2020-06-22 10:42:11,157 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 6 [2020-06-22 10:42:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,158 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-06-22 10:42:11,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2020-06-22 10:42:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:42:11,158 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,159 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash -735932605, now seen corresponding path program 1 times [2020-06-22 10:42:11,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,205 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 10:42:11,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,207 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand 3 states. [2020-06-22 10:42:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,326 INFO L93 Difference]: Finished difference Result 37 states and 66 transitions. [2020-06-22 10:42:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:42:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,327 INFO L225 Difference]: With dead ends: 37 [2020-06-22 10:42:11,327 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 10:42:11,328 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 10:42:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 10:42:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 10:42:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:42:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2020-06-22 10:42:11,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 6 [2020-06-22 10:42:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,333 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. [2020-06-22 10:42:11,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. [2020-06-22 10:42:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:42:11,333 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,334 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash -735932603, now seen corresponding path program 1 times [2020-06-22 10:42:11,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,377 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 10:42:11,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,378 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand 3 states. [2020-06-22 10:42:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,474 INFO L93 Difference]: Finished difference Result 34 states and 60 transitions. [2020-06-22 10:42:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:42:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,476 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:42:11,476 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:42:11,476 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 10:42:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:42:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:42:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:42:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2020-06-22 10:42:11,480 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 6 [2020-06-22 10:42:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,480 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2020-06-22 10:42:11,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2020-06-22 10:42:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:42:11,481 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,482 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1437484825, now seen corresponding path program 1 times [2020-06-22 10:42:11,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,506 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 10:42:11,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:42:11,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,508 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. [2020-06-22 10:42:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,603 INFO L93 Difference]: Finished difference Result 62 states and 102 transitions. [2020-06-22 10:42:11,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 10:42:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,604 INFO L225 Difference]: With dead ends: 62 [2020-06-22 10:42:11,605 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:42:11,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:42:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:42:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:42:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:42:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2020-06-22 10:42:11,609 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 8 [2020-06-22 10:42:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,609 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. [2020-06-22 10:42:11,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. [2020-06-22 10:42:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:42:11,610 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,610 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,611 INFO L82 PathProgramCache]: Analyzing trace with hash -755262567, now seen corresponding path program 1 times [2020-06-22 10:42:11,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,642 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 10:42:11,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,643 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 3 states. [2020-06-22 10:42:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,709 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2020-06-22 10:42:11,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 10:42:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,710 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:42:11,710 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:42:11,711 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 10:42:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:42:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:42:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:42:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2020-06-22 10:42:11,714 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 10 [2020-06-22 10:42:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,714 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2020-06-22 10:42:11,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2020-06-22 10:42:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:42:11,715 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,715 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -755262565, now seen corresponding path program 1 times [2020-06-22 10:42:11,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,744 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 10:42:11,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,745 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 3 states. [2020-06-22 10:42:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,795 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-06-22 10:42:11,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 10:42:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,796 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:42:11,796 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:42:11,797 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 10:42:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:42:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:42:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:42:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-06-22 10:42:11,800 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 10 [2020-06-22 10:42:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,801 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-06-22 10:42:11,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-06-22 10:42:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:42:11,801 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,801 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,802 INFO L82 PathProgramCache]: Analyzing trace with hash -755262564, now seen corresponding path program 1 times [2020-06-22 10:42:11,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,833 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 10:42:11,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,834 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2020-06-22 10:42:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,882 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-06-22 10:42:11,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 10:42:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,882 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:42:11,883 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:42:11,883 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 10:42:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:42:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:42:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:42:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:42:11,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-06-22 10:42:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,884 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:42:11,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:42:11,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:42:11,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:42:11,916 INFO L448 ceAbstractionStarter]: For program point L10-9(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,916 INFO L448 ceAbstractionStarter]: For program point L10-11(lines 10 19) no Hoare annotation was computed. [2020-06-22 10:42:11,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:42:11,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,917 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,917 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. [2020-06-22 10:42:11,918 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 10 19) the Hoare annotation is: (and (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_main_~d~0.base)) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4)) [2020-06-22 10:42:11,918 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:42:11,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:42:11,918 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,918 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,918 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,918 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:42:11,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,920 INFO L448 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,921 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,921 INFO L448 ceAbstractionStarter]: For program point L10-6(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:42:11,921 INFO L448 ceAbstractionStarter]: For program point L10-7(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,921 INFO L448 ceAbstractionStarter]: For program point L10-8(line 10) no Hoare annotation was computed. [2020-06-22 10:42:11,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:42:11,922 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:42:11,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:11 BasicIcfg [2020-06-22 10:42:11,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:42:11,941 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:42:11,941 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:42:11,944 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:42:11,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:42:09" (1/5) ... [2020-06-22 10:42:11,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47bd110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (2/5) ... [2020-06-22 10:42:11,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47bd110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:10" (3/5) ... [2020-06-22 10:42:11,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47bd110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:10" (4/5) ... [2020-06-22 10:42:11,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47bd110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:11" (5/5) ... [2020-06-22 10:42:11,950 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:42:11,971 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:42:11,972 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:42:11,972 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:42:11,972 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:42:11,972 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:42:11,972 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:42:11,972 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:42:11,972 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:42:11,972 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:42:11,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-06-22 10:42:11,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:11,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:11,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:11,987 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:11,987 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,987 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:42:11,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-06-22 10:42:11,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:11,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:11,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:11,990 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:11,990 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,995 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 10#L11-2true [2020-06-22 10:42:11,996 INFO L796 eck$LassoCheckResult]: Loop: 10#L11-2true [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 30#L10-1true [174] L10-1-->L10-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem3_3|) (not |v_ULTIMATE.start_main_#t~short5_2|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 28#L10-2true [120] L10-2-->L10-6: Formula: (not |v_ULTIMATE.start_main_#t~short5_5|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} AuxVars[] AssignedVars[] 44#L10-6true [180] L10-6-->L10-7: Formula: (and (not |v_ULTIMATE.start_main_#t~short5_6|) (not |v_ULTIMATE.start_main_#t~short7_2|)) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 42#L10-7true [133] L10-7-->L10-11: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 32#L10-11true [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 35#L11true [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 17#L12true [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 15#L12-1true [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 41#L13true [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 10#L11-2true [2020-06-22 10:42:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash 3858, now seen corresponding path program 1 times [2020-06-22 10:42:11,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2145126493, now seen corresponding path program 1 times [2020-06-22 10:42:12,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:12,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:12,043 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 10:42:12,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:12,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:42:12,044 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:42:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:12,046 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-06-22 10:42:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:12,143 INFO L93 Difference]: Finished difference Result 45 states and 81 transitions. [2020-06-22 10:42:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:12,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 81 transitions. [2020-06-22 10:42:12,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:12,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 21 states and 33 transitions. [2020-06-22 10:42:12,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:42:12,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:42:12,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2020-06-22 10:42:12,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:42:12,150 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-06-22 10:42:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2020-06-22 10:42:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:42:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:42:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-06-22 10:42:12,153 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-06-22 10:42:12,153 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-06-22 10:42:12,153 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:42:12,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2020-06-22 10:42:12,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:12,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:12,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:12,155 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:12,155 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:12,156 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 110#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 102#L11-2 [2020-06-22 10:42:12,156 INFO L796 eck$LassoCheckResult]: Loop: 102#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 107#L10-1 [174] L10-1-->L10-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem3_3|) (not |v_ULTIMATE.start_main_#t~short5_2|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 106#L10-2 [120] L10-2-->L10-6: Formula: (not |v_ULTIMATE.start_main_#t~short5_5|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} AuxVars[] AssignedVars[] 104#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 117#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 116#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 115#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 108#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 109#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 112#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 113#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 114#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 102#L11-2 [2020-06-22 10:42:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 3858, now seen corresponding path program 2 times [2020-06-22 10:42:12,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:12,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:12,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:12,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1046453311, now seen corresponding path program 1 times [2020-06-22 10:42:12,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:12,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:12,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:12,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:12,183 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 10:42:12,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:12,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:42:12,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:42:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:12,185 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-06-22 10:42:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:12,229 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2020-06-22 10:42:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:12,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 34 transitions. [2020-06-22 10:42:12,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:12,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 30 transitions. [2020-06-22 10:42:12,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:42:12,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:42:12,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-06-22 10:42:12,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:42:12,232 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 10:42:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-06-22 10:42:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:42:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:42:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-06-22 10:42:12,233 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 10:42:12,233 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 10:42:12,234 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:42:12,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-06-22 10:42:12,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:12,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:12,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:12,235 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:12,235 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:12,236 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 160#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 152#L11-2 [2020-06-22 10:42:12,236 INFO L796 eck$LassoCheckResult]: Loop: 152#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 157#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 156#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 155#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 153#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 154#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 167#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 166#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 165#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 158#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 159#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 162#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 163#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 164#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 152#L11-2 [2020-06-22 10:42:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:12,237 INFO L82 PathProgramCache]: Analyzing trace with hash 3858, now seen corresponding path program 3 times [2020-06-22 10:42:12,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:12,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:12,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:12,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 1 times [2020-06-22 10:42:12,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:12,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:12,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 787980561, now seen corresponding path program 1 times [2020-06-22 10:42:12,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:12,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,617 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-06-22 10:42:12,698 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:12,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:12,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:12,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:12,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:12,700 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:12,700 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:12,700 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:12,700 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:42:12,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:12,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:12,719 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 10:42:12,725 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 10:42:12,729 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 10:42:12,733 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 10:42:12,736 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 10:42:12,740 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 10:42:12,742 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 10:42:12,744 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 10:42:12,747 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 10:42:12,750 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 10:42:12,752 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 10:42:13,015 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-06-22 10:42:13,133 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-06-22 10:42:13,134 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 10:42:13,136 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 10:42:13,138 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 10:42:13,564 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:13,569 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:13,572 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 10:42:13,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,579 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 10:42:13,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,582 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 10:42:13,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,588 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 10:42:13,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,591 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 10:42:13,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,596 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 10:42:13,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,598 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 10:42:13,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,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 10:42:13,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,603 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 10:42:13,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,605 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 10:42:13,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,608 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 10:42:13,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,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 10:42:13,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,647 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 10:42:13,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,657 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 10:42:13,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,664 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 10:42:13,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,668 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:13,672 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:13,672 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:13,674 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:13,674 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:13,674 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:13,675 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2020-06-22 10:42:13,746 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:13,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:13,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:13,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:13,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:13,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:13,894 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:13,896 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:13,905 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:13,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:13,906 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:13,929 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 10:42:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:14,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:14,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:14,045 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:14,045 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,052 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:14,052 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,052 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:14,075 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:14,075 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,081 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:14,081 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,082 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:14,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:14,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:14,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:14,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,146 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:14,147 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,147 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:14,153 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:14,154 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,162 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:14,163 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,163 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:14,184 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:14,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:14,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:14,209 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:14,209 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,216 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:14,216 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:14,217 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:14,226 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:14,230 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 7 loop predicates [2020-06-22 10:42:14,231 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 30 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-06-22 10:42:14,557 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 30 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 90 states and 108 transitions. Complement of second has 22 states. [2020-06-22 10:42:14,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:14,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:14,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:14,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:14,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:14,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:14,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:14,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 108 transitions. [2020-06-22 10:42:14,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:14,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 68 states and 82 transitions. [2020-06-22 10:42:14,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-06-22 10:42:14,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-06-22 10:42:14,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 82 transitions. [2020-06-22 10:42:14,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:14,728 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-06-22 10:42:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 82 transitions. [2020-06-22 10:42:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-06-22 10:42:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:14,732 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:14,732 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:14,732 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:42:14,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:14,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:14,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:14,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:14,733 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:14,733 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:14,734 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 612#L-1 [168] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 595#L11-2 [2020-06-22 10:42:14,734 INFO L796 eck$LassoCheckResult]: Loop: 595#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 605#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 603#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 600#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 601#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 634#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 633#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 632#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 631#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 630#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 629#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 622#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 615#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 616#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 595#L11-2 [2020-06-22 10:42:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 3857, now seen corresponding path program 1 times [2020-06-22 10:42:14,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:14,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:14,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:14,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 2 times [2020-06-22 10:42:14,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash -719571248, now seen corresponding path program 1 times [2020-06-22 10:42:14,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:14,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:14,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:14,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:14,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:15,077 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:15,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:15,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:15,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:15,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:15,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:15,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:15,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:15,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:42:15,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:15,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:15,098 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 10:42:15,100 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 10:42:15,103 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 10:42:15,104 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 10:42:15,106 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 10:42:15,107 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 10:42:15,109 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 10:42:15,112 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 10:42:15,113 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 10:42:15,326 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-06-22 10:42:15,455 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-06-22 10:42:15,456 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 10:42:15,458 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 10:42:15,459 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 10:42:15,462 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 10:42:15,463 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 10:42:15,795 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:15,795 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:15,796 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 10:42:15,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,799 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 10:42:15,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:15,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:15,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,802 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 10:42:15,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,804 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 10:42:15,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,806 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 10:42:15,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,808 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 10:42:15,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,810 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 10:42:15,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:15,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:15,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,814 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 10:42:15,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,816 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 10:42:15,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:15,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:15,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,823 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 10:42:15,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,827 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 10:42:15,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:15,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:15,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,834 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 10:42:15,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,837 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 10:42:15,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:15,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:15,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:15,844 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 10:42:15,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:15,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:15,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:15,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:15,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:15,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:15,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:15,847 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:15,848 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:15,848 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:15,849 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:15,849 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:15,849 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:15,849 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2020-06-22 10:42:15,928 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:15,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:15,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:15,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:15,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:15,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:16,023 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:16,024 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,031 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:16,032 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,032 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:16,047 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 10:42:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:16,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:16,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:16,176 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:16,177 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,182 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:16,183 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,183 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:16,208 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:16,209 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,214 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:16,215 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,215 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:16,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:16,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:16,275 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:16,276 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:16,283 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,284 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:16,289 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:16,289 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,295 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:16,296 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,296 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:16,310 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:16,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:16,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:16,328 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:16,329 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,335 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:16,336 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:16,336 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:16,345 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:16,345 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 7 loop predicates [2020-06-22 10:42:16,346 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-06-22 10:42:16,688 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. [2020-06-22 10:42:16,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:16,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:16,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:16,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:16,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:16,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:16,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:16,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. [2020-06-22 10:42:16,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:16,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. [2020-06-22 10:42:16,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 10:42:16,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 10:42:16,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. [2020-06-22 10:42:16,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:16,701 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. [2020-06-22 10:42:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. [2020-06-22 10:42:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2020-06-22 10:42:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:16,704 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:16,704 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:16,704 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:42:16,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:16,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:16,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:16,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:16,706 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:16,706 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:16,706 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1103#L-1 [167] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1090#L11-2 [2020-06-22 10:42:16,707 INFO L796 eck$LassoCheckResult]: Loop: 1090#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1131#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1130#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 1129#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1128#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1123#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1121#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 1118#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1119#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1125#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1124#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 1117#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1111#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1112#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 1090#L11-2 [2020-06-22 10:42:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:16,707 INFO L82 PathProgramCache]: Analyzing trace with hash 3856, now seen corresponding path program 1 times [2020-06-22 10:42:16,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:16,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:16,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:16,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 3 times [2020-06-22 10:42:16,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:16,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2067844239, now seen corresponding path program 1 times [2020-06-22 10:42:16,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:16,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:16,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:17,017 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 10:42:17,076 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:17,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:17,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:17,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:17,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:17,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:17,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:17,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:17,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:42:17,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:17,077 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:17,080 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 10:42:17,273 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-06-22 10:42:17,383 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-06-22 10:42:17,383 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 10:42:17,385 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 10:42:17,387 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 10:42:17,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 10:42:17,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 10:42:17,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 10:42:17,394 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 10:42:17,396 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 10:42:17,398 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 10:42:17,399 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 10:42:17,401 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 10:42:17,403 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 10:42:17,405 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 10:42:17,742 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:17,742 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:17,742 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 10:42:17,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:17,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:17,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,749 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 10:42:17,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:17,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:17,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,756 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 10:42:17,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:17,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:17,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,763 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 10:42:17,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:17,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:17,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,771 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 10:42:17,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:17,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:17,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,775 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 10:42:17,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:17,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:17,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,778 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 10:42:17,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:17,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:17,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:17,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,781 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 10:42:17,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:17,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:17,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:17,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,783 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 10:42:17,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:17,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:17,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:17,790 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 10:42:17,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:17,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:17,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:17,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:17,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:17,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:17,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:17,792 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:17,794 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:17,794 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:17,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:17,794 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:17,794 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:17,794 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2020-06-22 10:42:17,867 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:17,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:17,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:17,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:17,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:17,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:17,995 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:17,996 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,008 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:18,009 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,010 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:18,028 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 10:42:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:18,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:18,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:18,135 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:18,136 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,142 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:18,142 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,142 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:18,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:18,168 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,173 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:18,174 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,174 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:18,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:18,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:18,236 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:18,237 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,243 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:18,244 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,244 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:18,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:18,250 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,256 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:18,256 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,256 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:18,271 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:18,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:18,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:18,298 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:18,299 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,309 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:18,310 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:18,310 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:18,318 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:18,319 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 7 loop predicates [2020-06-22 10:42:18,319 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-06-22 10:42:18,659 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. [2020-06-22 10:42:18,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:18,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. [2020-06-22 10:42:18,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:18,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. [2020-06-22 10:42:18,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 10:42:18,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 10:42:18,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. [2020-06-22 10:42:18,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:18,670 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. [2020-06-22 10:42:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. [2020-06-22 10:42:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2020-06-22 10:42:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:18,673 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:18,673 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:18,673 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:42:18,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:18,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:18,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:18,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:18,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:18,675 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:18,675 INFO L794 eck$LassoCheckResult]: Stem: 1604#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1598#L-1 [166] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1585#L11-2 [2020-06-22 10:42:18,675 INFO L796 eck$LassoCheckResult]: Loop: 1585#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1626#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1625#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 1624#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1623#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1618#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1616#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 1613#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1614#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1620#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1619#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 1612#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1606#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1607#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 1585#L11-2 [2020-06-22 10:42:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 3855, now seen corresponding path program 1 times [2020-06-22 10:42:18,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:18,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 4 times [2020-06-22 10:42:18,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:18,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:18,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash 560292430, now seen corresponding path program 1 times [2020-06-22 10:42:18,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:18,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:18,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:18,941 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:18,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:18,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:18,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:18,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:18,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:18,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:18,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:18,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 10:42:18,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:18,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:18,945 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 10:42:18,947 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 10:42:18,949 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 10:42:19,141 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-06-22 10:42:19,267 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-06-22 10:42:19,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 10:42:19,271 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 10:42:19,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 10:42:19,276 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 10:42:19,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 10:42:19,279 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 10:42:19,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 10:42:19,282 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 10:42:19,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 10:42:19,285 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 10:42:19,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 10:42:19,613 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:19,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:19,614 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 10:42:19,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:19,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:19,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:19,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,616 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 10:42:19,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:19,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:19,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,619 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 10:42:19,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:19,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:19,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,622 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 10:42:19,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:19,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:19,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,625 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 10:42:19,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:19,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:19,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,631 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 10:42:19,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:19,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:19,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,637 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 10:42:19,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:19,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:19,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:19,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,640 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 10:42:19,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:19,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,655 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 10:42:19,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:19,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:19,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,661 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 10:42:19,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:19,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:19,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:19,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:19,663 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 10:42:19,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:19,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:19,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:19,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:19,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:19,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:19,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:19,666 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:19,667 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:19,667 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:19,667 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:19,667 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:19,668 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:19,668 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2020-06-22 10:42:19,732 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:19,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:19,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:19,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:19,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:19,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:19,835 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:19,836 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:19,843 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:19,843 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:19,844 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:19,858 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 10:42:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:19,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:19,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:19,955 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:19,956 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:19,963 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:19,963 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:19,963 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:19,984 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:19,984 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:19,989 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:19,990 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:19,990 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:20,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:20,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:20,043 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:20,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:20,049 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:20,049 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:20,049 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:20,054 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:20,054 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:20,059 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:20,059 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:20,060 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:20,071 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:20,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:20,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:20,084 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:20,085 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:20,090 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:20,091 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:20,091 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:20,099 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:20,099 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 7 loop predicates [2020-06-22 10:42:20,099 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-06-22 10:42:20,400 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. [2020-06-22 10:42:20,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:20,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:20,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:20,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. [2020-06-22 10:42:20,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:20,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. [2020-06-22 10:42:20,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 10:42:20,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 10:42:20,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. [2020-06-22 10:42:20,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:20,410 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. [2020-06-22 10:42:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. [2020-06-22 10:42:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2020-06-22 10:42:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:20,413 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:20,413 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:20,413 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:42:20,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:20,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:20,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:20,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:20,414 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:20,414 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:20,415 INFO L794 eck$LassoCheckResult]: Stem: 2100#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 2098#L-1 [165] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2080#L11-2 [2020-06-22 10:42:20,415 INFO L796 eck$LassoCheckResult]: Loop: 2080#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2093#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2087#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 2085#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 2081#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2082#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2112#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 2109#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2110#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2115#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2114#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 2108#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2102#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 2103#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 2080#L11-2 [2020-06-22 10:42:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash 3854, now seen corresponding path program 1 times [2020-06-22 10:42:20,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:20,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:20,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:20,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 5 times [2020-06-22 10:42:20,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:20,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:20,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash -947259379, now seen corresponding path program 1 times [2020-06-22 10:42:20,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:20,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:20,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:20,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:20,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:20,689 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 10:42:20,750 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:20,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:20,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:20,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:20,751 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:20,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:20,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:20,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:20,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 10:42:20,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:20,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:20,754 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 10:42:20,756 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 10:42:20,960 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-06-22 10:42:21,065 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 10:42:21,067 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 10:42:21,068 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 10:42:21,069 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 10:42:21,071 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 10:42:21,072 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 10:42:21,074 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 10:42:21,075 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 10:42:21,077 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 10:42:21,078 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 10:42:21,081 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 10:42:21,083 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 10:42:21,401 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:21,401 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:21,401 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 10:42:21,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:21,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:21,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:21,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:21,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:21,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:21,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:21,405 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 10:42:21,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:21,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:21,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:21,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:21,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:21,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:21,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:21,410 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 10:42:21,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:21,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:21,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:21,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:21,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:21,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:21,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:21,412 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 10:42:21,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:21,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:21,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:21,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:21,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:21,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:21,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:21,418 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 10:42:21,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:21,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:21,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:21,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:21,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:21,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:21,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:21,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:21,420 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 10:42:21,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:21,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:21,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:21,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:21,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:21,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:21,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:21,425 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 10:42:21,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:21,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:21,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:21,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:21,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:21,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:21,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:21,428 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:21,429 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:21,429 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:21,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:21,429 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:21,429 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:21,429 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2020-06-22 10:42:21,493 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:21,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:21,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:21,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:21,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:21,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:21,606 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:21,607 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,618 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:21,619 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,619 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:21,637 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 10:42:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:21,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:21,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:21,744 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:21,744 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,749 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:21,750 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,750 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:21,770 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:21,770 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,775 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:21,776 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,776 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:21,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:21,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:21,829 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:21,830 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,835 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:21,836 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,836 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:21,840 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:21,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,845 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:21,846 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,846 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:21,858 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:21,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:21,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:21,871 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:21,871 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,876 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:21,876 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:21,877 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:21,884 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:21,884 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 7 loop predicates [2020-06-22 10:42:21,884 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-06-22 10:42:22,180 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. [2020-06-22 10:42:22,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:22,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:22,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:22,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:22,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:22,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:22,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:22,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. [2020-06-22 10:42:22,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:22,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. [2020-06-22 10:42:22,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 10:42:22,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 10:42:22,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. [2020-06-22 10:42:22,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:22,191 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. [2020-06-22 10:42:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. [2020-06-22 10:42:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2020-06-22 10:42:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:22,194 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:22,194 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:22,194 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:42:22,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:22,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:22,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:22,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:22,195 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:22,195 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:22,196 INFO L794 eck$LassoCheckResult]: Stem: 2594#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 2592#L-1 [164] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2575#L11-2 [2020-06-22 10:42:22,196 INFO L796 eck$LassoCheckResult]: Loop: 2575#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2616#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2615#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 2614#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 2613#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2612#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2611#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 2610#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2609#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2608#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2607#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 2602#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2595#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 2596#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 2575#L11-2 [2020-06-22 10:42:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash 3853, now seen corresponding path program 1 times [2020-06-22 10:42:22,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:22,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:22,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 6 times [2020-06-22 10:42:22,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:22,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:22,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:22,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:22,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1840156108, now seen corresponding path program 1 times [2020-06-22 10:42:22,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:22,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:22,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:22,451 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-06-22 10:42:22,501 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:22,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:22,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:22,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:22,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:22,502 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:22,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:22,502 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:22,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 10:42:22,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:22,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:22,504 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 10:42:22,507 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 10:42:22,508 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 10:42:22,510 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 10:42:22,511 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 10:42:22,513 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 10:42:22,514 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 10:42:22,515 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 10:42:22,702 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-06-22 10:42:22,805 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 10:42:22,807 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 10:42:22,808 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 10:42:22,811 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 10:42:22,812 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 10:42:22,813 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 10:42:23,144 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:23,144 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:23,144 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 10:42:23,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,147 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 10:42:23,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,149 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 10:42:23,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,152 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 10:42:23,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,153 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 10:42:23,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,155 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 10:42:23,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,157 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 10:42:23,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,158 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 10:42:23,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,163 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 10:42:23,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,169 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 10:42:23,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,182 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 10:42:23,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,185 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 10:42:23,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,188 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 10:42:23,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,193 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 10:42:23,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,198 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 10:42:23,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:23,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:23,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:23,203 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 10:42:23,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:23,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:23,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:23,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:23,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:23,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:23,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:23,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:23,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:23,206 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:23,207 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:23,207 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:23,207 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:23,207 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6 Supporting invariants [] [2020-06-22 10:42:23,265 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:23,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:23,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:23,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:23,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:23,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:23,353 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:23,354 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,361 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:23,361 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,361 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:23,375 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 10:42:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:23,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:23,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:23,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:23,482 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,488 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:23,488 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,488 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:23,508 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:23,509 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,514 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:23,514 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,515 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:23,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:23,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:23,565 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:23,565 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,571 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:23,571 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,571 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:23,575 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:23,576 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,581 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:23,581 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,582 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:23,593 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:23,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:23,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:23,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:23,610 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,615 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:23,616 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:23,616 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:23,623 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:23,623 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 7 loop predicates [2020-06-22 10:42:23,624 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-06-22 10:42:23,922 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. [2020-06-22 10:42:23,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:23,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:23,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:23,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:23,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:23,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:23,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:23,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. [2020-06-22 10:42:23,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:23,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. [2020-06-22 10:42:23,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 10:42:23,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 10:42:23,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. [2020-06-22 10:42:23,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:23,931 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. [2020-06-22 10:42:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. [2020-06-22 10:42:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2020-06-22 10:42:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:23,934 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:23,934 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:23,934 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 10:42:23,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:23,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:23,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:23,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:23,935 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:23,935 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:23,936 INFO L794 eck$LassoCheckResult]: Stem: 3090#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3088#L-1 [163] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3070#L11-2 [2020-06-22 10:42:23,936 INFO L796 eck$LassoCheckResult]: Loop: 3070#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3083#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3077#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 3075#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 3071#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3072#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3102#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 3099#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3100#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3105#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3104#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 3098#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 3092#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 3093#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 3070#L11-2 [2020-06-22 10:42:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash 3852, now seen corresponding path program 1 times [2020-06-22 10:42:23,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:23,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:23,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:23,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 7 times [2020-06-22 10:42:23,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:23,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:23,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash 332604299, now seen corresponding path program 1 times [2020-06-22 10:42:23,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:23,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:23,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:23,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:23,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:24,202 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 10:42:24,266 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:24,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:24,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:24,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:24,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:24,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:24,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:24,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:24,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso [2020-06-22 10:42:24,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:24,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:24,269 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 10:42:24,477 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-06-22 10:42:24,581 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-06-22 10:42:24,581 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 10:42:24,584 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 10:42:24,585 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 10:42:24,587 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 10:42:24,588 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 10:42:24,590 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 10:42:24,591 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 10:42:24,592 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 10:42:24,595 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 10:42:24,596 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 10:42:24,598 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 10:42:24,599 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 10:42:24,601 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 10:42:24,909 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:24,910 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:24,910 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 10:42:24,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:24,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:24,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:24,922 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 10:42:24,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:24,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:24,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:24,929 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 10:42:24,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:24,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:24,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:24,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:24,931 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 10:42:24,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:24,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:24,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:24,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:24,934 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 10:42:24,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:24,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:24,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:24,938 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 10:42:24,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:24,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:24,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:24,943 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 10:42:24,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:24,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:24,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:24,948 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 10:42:24,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:24,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:24,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:24,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:24,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:24,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:24,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:24,950 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:24,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:24,951 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:24,951 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:24,951 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:24,951 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:24,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 Supporting invariants [] [2020-06-22 10:42:25,005 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:25,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:25,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:25,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:25,095 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:25,096 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,115 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:25,115 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,115 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:25,131 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 10:42:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:25,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:25,239 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:25,240 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,246 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:25,246 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,247 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:25,267 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:25,268 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,273 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:25,274 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,274 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:25,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:25,327 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:25,328 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,333 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:25,334 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,334 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:25,338 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:25,338 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,345 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:25,345 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,345 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:25,359 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:25,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:25,372 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:25,372 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,377 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:25,378 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:25,378 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:25,384 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:25,385 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 7 loop predicates [2020-06-22 10:42:25,385 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-06-22 10:42:25,671 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. [2020-06-22 10:42:25,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:25,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:25,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:25,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:25,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:25,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:25,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:25,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. [2020-06-22 10:42:25,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:25,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. [2020-06-22 10:42:25,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 10:42:25,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 10:42:25,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. [2020-06-22 10:42:25,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:25,680 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. [2020-06-22 10:42:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. [2020-06-22 10:42:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2020-06-22 10:42:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:25,683 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:25,683 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:25,683 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 10:42:25,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:25,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:25,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:25,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:25,684 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:42:25,684 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:25,684 INFO L794 eck$LassoCheckResult]: Stem: 3585#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3583#L-1 [162] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3565#L11-2 [2020-06-22 10:42:25,685 INFO L796 eck$LassoCheckResult]: Loop: 3565#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3578#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3572#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 3570#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 3566#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3567#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3597#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 3594#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3595#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3600#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3599#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 3593#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 3587#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 3588#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 3565#L11-2 [2020-06-22 10:42:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 3851, now seen corresponding path program 1 times [2020-06-22 10:42:25,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:25,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 8 times [2020-06-22 10:42:25,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:25,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1174947510, now seen corresponding path program 1 times [2020-06-22 10:42:25,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:25,959 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-06-22 10:42:26,013 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:26,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:26,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:26,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:26,014 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:26,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:26,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:26,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:26,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso [2020-06-22 10:42:26,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:26,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:26,016 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 10:42:26,187 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-06-22 10:42:26,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 10:42:26,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 10:42:26,294 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 10:42:26,296 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 10:42:26,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 10:42:26,298 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 10:42:26,300 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 10:42:26,301 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 10:42:26,302 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 10:42:26,304 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 10:42:26,306 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 10:42:26,307 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 10:42:26,309 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 10:42:26,634 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:26,634 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:26,634 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 10:42:26,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:26,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:26,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:26,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:26,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:26,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:26,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:26,640 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 10:42:26,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:26,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:26,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:26,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:26,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:26,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:26,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:26,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 10:42:26,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:26,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:26,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:26,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:26,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:26,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:26,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:26,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:26,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 10:42:26,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:26,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:26,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:26,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:26,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:26,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:26,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:26,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 10:42:26,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:26,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:26,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:26,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:26,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:26,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:26,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:26,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:26,659 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 10:42:26,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:26,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:26,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:26,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:26,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:26,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:26,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:26,663 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 10:42:26,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:26,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:26,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:26,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:26,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:26,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:26,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:26,666 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:26,667 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:26,667 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:26,667 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:26,667 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:26,667 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:26,667 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8 Supporting invariants [] [2020-06-22 10:42:26,730 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:26,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:26,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:26,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:26,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:26,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:26,832 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:42:26,833 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:26,840 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:26,841 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:26,841 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:42:26,857 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 10:42:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:26,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:26,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:26,962 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:26,963 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:26,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:26,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:26,969 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:26,991 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:26,991 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:26,997 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:26,998 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:26,998 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:27,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:27,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:27,060 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:27,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:27,067 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:27,067 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:27,067 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:27,073 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:27,073 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:27,080 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:27,080 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:27,081 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:42:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,096 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:27,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:27,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:27,113 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:27,113 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:27,124 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:27,124 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:27,125 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:27,132 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:42:27,133 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 7 loop predicates [2020-06-22 10:42:27,133 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-06-22 10:42:27,460 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. [2020-06-22 10:42:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:42:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-06-22 10:42:27,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:42:27,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:27,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. [2020-06-22 10:42:27,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:27,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. [2020-06-22 10:42:27,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:27,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. [2020-06-22 10:42:27,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-06-22 10:42:27,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. [2020-06-22 10:42:27,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 10:42:27,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 10:42:27,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. [2020-06-22 10:42:27,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:27,468 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. [2020-06-22 10:42:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. [2020-06-22 10:42:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2020-06-22 10:42:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:42:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-06-22 10:42:27,471 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:27,471 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-06-22 10:42:27,471 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 10:42:27,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-06-22 10:42:27,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:42:27,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:27,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:27,473 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:27,473 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:27,474 INFO L794 eck$LassoCheckResult]: Stem: 4080#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 4074#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4075#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4070#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4101#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 4100#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 4099#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4093#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4091#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 4089#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4086#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4076#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4077#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 4057#L15 [2020-06-22 10:42:27,474 INFO L796 eck$LassoCheckResult]: Loop: 4057#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 4058#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 4055#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 4056#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 4059#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 4060#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4073#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4067#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 4065#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 4061#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4062#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4098#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 4097#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4096#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4095#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4094#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 4057#L15 [2020-06-22 10:42:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2086401323, now seen corresponding path program 1 times [2020-06-22 10:42:27,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash -599343318, now seen corresponding path program 1 times [2020-06-22 10:42:27,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:27,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:27,497 INFO L82 PathProgramCache]: Analyzing trace with hash 121807358, now seen corresponding path program 1 times [2020-06-22 10:42:27,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:27,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:27,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:27,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,622 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-06-22 10:42:27,970 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2020-06-22 10:42:28,052 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:28,052 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:28,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:28,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:28,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:28,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:28,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:28,053 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:28,053 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso [2020-06-22 10:42:28,053 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:28,053 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:28,055 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 10:42:28,282 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-06-22 10:42:28,392 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-06-22 10:42:28,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 10:42:28,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 10:42:28,397 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 10:42:28,398 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 10:42:28,401 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 10:42:28,402 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 10:42:28,403 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 10:42:28,405 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 10:42:28,407 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 10:42:28,409 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 10:42:28,411 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 10:42:28,412 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 10:42:28,414 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 10:42:28,823 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:28,823 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:28,823 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 10:42:28,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:28,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:28,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:28,828 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 10:42:28,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:28,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:28,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:28,833 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 10:42:28,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:28,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:28,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:28,846 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:28,847 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:42:28,848 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:28,849 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:42:28,849 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:28,849 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_9 Supporting invariants [] [2020-06-22 10:42:28,934 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:28,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:28,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:28,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:28,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:42:28,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:42:28,985 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:28,991 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:28,992 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:28,992 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2020-06-22 10:42:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:29,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:29,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:29,018 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:42:29,019 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:29,024 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:29,024 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:29,024 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:42:29,065 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:29,065 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 [2020-06-22 10:42:29,071 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:29,118 INFO L497 ElimStorePlain]: treesize reduction 35, result has 53.9 percent of original size [2020-06-22 10:42:29,119 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:42:29,119 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:31 [2020-06-22 10:42:34,591 WARN L188 SmtUtils]: Spent 2.75 s on a formula simplification that was a NOOP. DAG size: 23 [2020-06-22 10:42:35,998 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:35,998 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:36,004 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:36,004 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:36,004 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:36,060 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 10:42:37,488 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~y~0.base Int) (ULTIMATE.start_main_~y~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~d~0.offset ULTIMATE.start_main_~y~0.offset) (= c_ULTIMATE.start_main_~d~0.base ULTIMATE.start_main_~y~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~d~0.base) c_ULTIMATE.start_main_~d~0.offset) 1) c_oldRank0)) is different from true [2020-06-22 10:42:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:37,559 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:37,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:37,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:37,573 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:42:37,574 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:37,580 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:37,580 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:37,580 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:42:37,586 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:42:37,586 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:37,595 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:37,595 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:37,595 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:42:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:37,632 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:37,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:37,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:40,496 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:42:40,496 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:40,503 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:40,503 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:40,504 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-06-22 10:42:41,981 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:41,981 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 [2020-06-22 10:42:41,985 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:42,039 INFO L497 ElimStorePlain]: treesize reduction 39, result has 57.1 percent of original size [2020-06-22 10:42:42,040 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:42:42,041 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 [2020-06-22 10:42:47,697 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 26 [2020-06-22 10:42:51,944 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_main_~y~0.base Int) (ULTIMATE.start_main_~y~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~d~0.offset ULTIMATE.start_main_~y~0.offset) (= c_ULTIMATE.start_main_~d~0.base ULTIMATE.start_main_~y~0.base))))) is different from true [2020-06-22 10:42:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:52,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:52,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:52,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:42:52,023 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,030 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:52,031 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,031 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-06-22 10:42:52,054 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:52,054 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 [2020-06-22 10:42:52,058 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,115 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size [2020-06-22 10:42:52,116 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:42:52,117 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 [2020-06-22 10:42:52,126 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2020-06-22 10:42:52,126 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,130 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:42:52,131 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,148 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size [2020-06-22 10:42:52,149 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,149 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 [2020-06-22 10:42:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:52,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:52,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:52,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:42:52,226 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,234 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:52,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-06-22 10:42:52,258 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:52,258 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 [2020-06-22 10:42:52,262 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,320 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size [2020-06-22 10:42:52,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:42:52,322 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 [2020-06-22 10:42:52,337 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:42:52,338 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,343 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2020-06-22 10:42:52,343 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,363 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size [2020-06-22 10:42:52,363 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:52,363 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 [2020-06-22 10:42:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:52,405 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:52,405 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 10:42:52,405 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 13 loop predicates [2020-06-22 10:42:52,405 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 10 states. [2020-06-22 10:43:10,303 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 650 states and 697 transitions. Complement of second has 295 states. [2020-06-22 10:43:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 3 stem states 17 non-accepting loop states 2 accepting loop states [2020-06-22 10:43:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:43:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2020-06-22 10:43:10,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 110 transitions. Stem has 13 letters. Loop has 16 letters. [2020-06-22 10:43:10,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:10,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 110 transitions. Stem has 29 letters. Loop has 16 letters. [2020-06-22 10:43:10,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:10,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 110 transitions. Stem has 13 letters. Loop has 32 letters. [2020-06-22 10:43:10,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:10,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 697 transitions. [2020-06-22 10:43:10,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 116 [2020-06-22 10:43:10,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 258 states and 287 transitions. [2020-06-22 10:43:10,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-06-22 10:43:10,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2020-06-22 10:43:10,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 287 transitions. [2020-06-22 10:43:10,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:43:10,318 INFO L706 BuchiCegarLoop]: Abstraction has 258 states and 287 transitions. [2020-06-22 10:43:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 287 transitions. [2020-06-22 10:43:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 83. [2020-06-22 10:43:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-06-22 10:43:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2020-06-22 10:43:10,322 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 98 transitions. [2020-06-22 10:43:10,322 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 98 transitions. [2020-06-22 10:43:10,322 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 10:43:10,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 98 transitions. [2020-06-22 10:43:10,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2020-06-22 10:43:10,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:43:10,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:43:10,323 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:43:10,323 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:43:10,324 INFO L794 eck$LassoCheckResult]: Stem: 5517#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 5515#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5516#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5542#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5558#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 5557#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5554#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5555#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5550#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5551#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5546#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5547#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5543#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 5488#L15 [2020-06-22 10:43:10,325 INFO L796 eck$LassoCheckResult]: Loop: 5488#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 5489#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 5492#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 5493#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5494#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 5495#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5507#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5570#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 5569#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5568#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5567#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5565#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5563#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5561#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5559#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5512#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 5518#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5519#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5520#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 5505#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5506#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5503#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 5500#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5501#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5552#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5553#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5548#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5549#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5544#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5545#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 5488#L15 [2020-06-22 10:43:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2086401323, now seen corresponding path program 2 times [2020-06-22 10:43:10,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:10,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:10,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:10,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:43:10,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash 513642251, now seen corresponding path program 1 times [2020-06-22 10:43:10,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:10,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:10,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:43:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash 333049567, now seen corresponding path program 1 times [2020-06-22 10:43:10,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:10,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:10,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:43:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:10,879 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2020-06-22 10:43:11,229 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2020-06-22 10:43:11,311 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:43:11,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:43:11,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:43:11,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:43:11,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:43:11,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:43:11,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:43:11,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:43:11,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso [2020-06-22 10:43:11,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:43:11,312 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:43:11,314 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 10:43:11,316 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 10:43:11,318 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 10:43:11,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 10:43:11,521 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-06-22 10:43:11,660 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-06-22 10:43:11,661 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 10:43:11,662 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 10:43:11,664 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 10:43:11,666 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 10:43:11,667 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 10:43:11,669 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 10:43:11,671 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 10:43:11,672 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 10:43:11,675 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 10:43:11,676 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 10:43:12,023 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:43:12,023 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:43:12,023 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 10:43:12,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:12,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:12,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:12,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:12,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:12,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:12,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:12,026 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 10:43:12,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:12,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:43:12,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:12,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:12,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:12,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:43:12,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:43:12,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:12,028 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 10:43:12,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:12,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:12,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:12,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:12,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:12,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:12,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:12,030 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 10:43:12,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:12,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:12,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:12,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:12,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:12,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:12,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:12,034 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 10:43:12,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:12,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:12,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:12,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:12,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:12,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:12,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:12,039 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 10:43:12,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:12,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:12,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:12,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:12,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:12,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:12,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:12,041 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 10:43:12,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:12,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:12,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:12,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:12,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:12,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:12,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:43:12,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:43:12,049 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:43:12,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:43:12,050 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:43:12,050 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:43:12,050 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 Supporting invariants [] [2020-06-22 10:43:12,125 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:43:12,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:43:12,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:12,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:43:12,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:12,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:12,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:12,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:12,196 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,203 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,203 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,203 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:12,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:12,226 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,233 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:12,251 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:12,252 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,259 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,259 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:12,300 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-06-22 10:43:12,301 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,310 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,310 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,311 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2020-06-22 10:43:12,315 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:12,316 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,325 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,326 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,326 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-06-22 10:43:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 10:43:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:12,462 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:43:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:12,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:12,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:12,482 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,489 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,490 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,490 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:12,545 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:12,545 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,554 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,554 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,554 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:12,558 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,559 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,567 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,567 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,567 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,573 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,574 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,589 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,590 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,590 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:12,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:12,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:12,653 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:12,653 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,662 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,663 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,663 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:12,688 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:12,689 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,700 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,701 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,701 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:12,706 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,706 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,717 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,717 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,718 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,724 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,724 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,735 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,736 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,736 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,741 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:12,741 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,752 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,752 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,752 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:12,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:12,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:12,834 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:12,835 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,846 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,847 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,847 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:12,852 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,852 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,864 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,864 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,865 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,873 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,883 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,883 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,883 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,888 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:12,888 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,898 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,898 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,898 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:12,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:12,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:12,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:12,924 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,934 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,934 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,934 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:12,939 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,939 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,949 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,950 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,950 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,955 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:12,956 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,965 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,965 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,965 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:12,970 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:12,970 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,979 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,980 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,980 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:12,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:12,985 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,995 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:12,995 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:12,995 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,019 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:13,020 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,028 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,028 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,028 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:13,037 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,037 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,044 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,044 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,044 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,055 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:13,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,065 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,065 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:13,070 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:13,070 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,079 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,079 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,079 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:13,084 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,084 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,093 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,093 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,094 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,118 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:13,119 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,128 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,128 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,128 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:13,138 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,138 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,146 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,146 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,147 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,168 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,168 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,177 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,177 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,178 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,189 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:13,190 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,198 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,199 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,199 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:13,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,205 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,216 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,216 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,217 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,248 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:13,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,258 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,259 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:13,269 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,270 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,277 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,278 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,278 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,289 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,289 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,296 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,297 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,297 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,307 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:13,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,315 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,315 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,316 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:13,320 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,321 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,329 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,329 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,329 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,355 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,355 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,362 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,363 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,363 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,373 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:13,374 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,384 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,384 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:13,409 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:13,409 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,418 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,418 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,419 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:13,423 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,423 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,433 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,433 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,433 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,461 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:13,462 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,472 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,473 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,473 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:13,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:13,482 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,491 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,492 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,492 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:13,497 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,497 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,507 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,507 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,508 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:13,514 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,514 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,523 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,524 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,524 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,554 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:13,554 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,565 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,565 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,565 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:13,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:13,571 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,581 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,581 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,582 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:13,586 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,587 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,598 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,598 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,598 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:13,606 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,606 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,617 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,618 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,618 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:13,623 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:13,623 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,633 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,634 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,634 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:43:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,664 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,665 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,675 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,676 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,676 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,686 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:13,687 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,695 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,696 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,696 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:13,703 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,704 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,713 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,713 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,713 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:13,720 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-06-22 10:43:13,720 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,732 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,732 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,732 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2020-06-22 10:43:13,737 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:13,738 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,748 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,749 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,749 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-06-22 10:43:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:13,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:13,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:13,779 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:13,780 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,788 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,789 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,789 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:13,800 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:13,801 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,811 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,811 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,811 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:13,817 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:13,818 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,827 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,828 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,828 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:13,836 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-06-22 10:43:13,837 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,848 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,849 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,849 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2020-06-22 10:43:13,856 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:13,856 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,867 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:13,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:13,868 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-06-22 10:43:13,870 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:43:13,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 8 loop predicates [2020-06-22 10:43:13,871 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 83 states and 98 transitions. cyclomatic complexity: 17 Second operand 8 states. [2020-06-22 10:43:15,272 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 83 states and 98 transitions. cyclomatic complexity: 17. Second operand 8 states. Result 902 states and 991 transitions. Complement of second has 92 states. [2020-06-22 10:43:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 34 states 8 stem states 21 non-accepting loop states 5 accepting loop states [2020-06-22 10:43:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:43:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 270 transitions. [2020-06-22 10:43:15,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 270 transitions. Stem has 13 letters. Loop has 30 letters. [2020-06-22 10:43:15,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:15,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 270 transitions. Stem has 43 letters. Loop has 30 letters. [2020-06-22 10:43:15,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:15,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 270 transitions. Stem has 13 letters. Loop has 60 letters. [2020-06-22 10:43:15,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:15,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 902 states and 991 transitions. [2020-06-22 10:43:15,290 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 399 [2020-06-22 10:43:15,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 902 states to 705 states and 781 transitions. [2020-06-22 10:43:15,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2020-06-22 10:43:15,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2020-06-22 10:43:15,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 781 transitions. [2020-06-22 10:43:15,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:43:15,296 INFO L706 BuchiCegarLoop]: Abstraction has 705 states and 781 transitions. [2020-06-22 10:43:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 781 transitions. [2020-06-22 10:43:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 190. [2020-06-22 10:43:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-06-22 10:43:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2020-06-22 10:43:15,320 INFO L729 BuchiCegarLoop]: Abstraction has 190 states and 217 transitions. [2020-06-22 10:43:15,320 INFO L609 BuchiCegarLoop]: Abstraction has 190 states and 217 transitions. [2020-06-22 10:43:15,320 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 10:43:15,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 217 transitions. [2020-06-22 10:43:15,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-06-22 10:43:15,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:43:15,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:43:15,323 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:43:15,323 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:43:15,323 INFO L794 eck$LassoCheckResult]: Stem: 7966#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 7963#L-1 [168] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 7964#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 7956#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 7953#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 7951#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 7946#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 7947#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8107#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 7975#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 7972#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 7959#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 7960#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 7936#L15 [2020-06-22 10:43:15,324 INFO L796 eck$LassoCheckResult]: Loop: 7936#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 7937#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 7940#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 7941#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 8121#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 8119#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8117#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8115#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 8113#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 8111#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8109#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8108#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 8105#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 8103#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8100#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 8075#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 7974#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 7968#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 7969#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 8086#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8085#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8084#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 8083#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 8082#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8081#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8080#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 8079#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 8078#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8077#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 8076#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 7936#L15 [2020-06-22 10:43:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2079483254, now seen corresponding path program 1 times [2020-06-22 10:43:15,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:15,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:15,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:43:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:15,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 513642251, now seen corresponding path program 2 times [2020-06-22 10:43:15,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:15,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:15,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:15,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:43:15,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash 208976320, now seen corresponding path program 1 times [2020-06-22 10:43:15,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:15,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:15,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:43:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:15,847 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2020-06-22 10:43:16,200 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2020-06-22 10:43:16,296 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:43:16,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:43:16,297 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:43:16,297 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:43:16,297 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:43:16,297 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:43:16,297 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:43:16,297 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:43:16,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso [2020-06-22 10:43:16,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:43:16,297 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:43:16,300 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 10:43:16,521 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2020-06-22 10:43:16,641 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-06-22 10:43:16,641 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 10:43:16,643 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 10:43:16,644 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 10:43:16,646 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 10:43:16,648 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 10:43:16,650 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 10:43:16,652 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 10:43:16,655 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 10:43:16,657 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 10:43:16,659 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 10:43:16,672 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 10:43:16,674 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 10:43:16,676 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 10:43:17,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:43:17,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:43:17,017 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 10:43:17,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:17,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:17,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:17,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:17,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:17,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:17,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:17,020 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 10:43:17,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:17,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:17,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:17,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:17,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:17,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:17,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:17,027 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 10:43:17,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:17,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:17,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:17,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:17,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:17,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:17,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:17,031 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 10:43:17,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:17,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:17,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:17,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:17,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:17,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:17,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:17,035 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 10:43:17,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:17,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:17,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:17,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:17,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:17,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:17,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:17,039 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 10:43:17,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:17,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:17,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:17,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:17,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:17,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:17,044 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:43:17,048 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:43:17,048 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:43:17,048 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:43:17,049 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:43:17,049 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:43:17,049 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_11) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_11 Supporting invariants [] [2020-06-22 10:43:17,130 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:43:17,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:43:17,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:17,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:17,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:17,178 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,179 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-06-22 10:43:17,179 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,185 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,185 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,185 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2020-06-22 10:43:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:17,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:17,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:17,218 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:17,218 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,225 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,225 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,226 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:17,248 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:17,248 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,255 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,256 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,256 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:17,274 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:17,275 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,284 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,284 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:17,327 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-06-22 10:43:17,327 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,337 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,337 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,337 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2020-06-22 10:43:17,342 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:17,342 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,351 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,351 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,352 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-06-22 10:43:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 10:43:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:17,457 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:43:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:17,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:17,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:17,477 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:17,477 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,484 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,484 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,485 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:17,536 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:17,536 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,545 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,545 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,545 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:17,549 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,549 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,558 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,559 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,559 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,563 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,564 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,573 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,573 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,573 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:17,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:17,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:17,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:17,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,627 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,628 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,628 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:17,638 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:17,639 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,648 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,649 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,649 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:17,653 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,653 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,662 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,662 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,662 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,668 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,668 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,677 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,677 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,678 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,682 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:17,682 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,690 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,691 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,691 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:17,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:17,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:17,751 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:17,752 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,760 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,761 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,761 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:17,769 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,770 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,778 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,778 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,778 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,783 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,784 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,792 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,793 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,793 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,796 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:17,797 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,805 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,805 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,805 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:17,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:17,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:17,828 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:17,829 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,837 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,838 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,838 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2020-06-22 10:43:17,842 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,842 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,851 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,851 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,851 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,857 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,857 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,866 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,866 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,866 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,871 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:17,871 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,882 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,882 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,882 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:17,886 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:17,887 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,896 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,896 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,897 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:17,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:17,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:17,923 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:17,923 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,932 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,932 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,933 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:17,941 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:17,942 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,949 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,949 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,949 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:17,962 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:17,962 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,979 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,980 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,980 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:17,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:17,986 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,998 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:17,998 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:17,998 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:18,004 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,004 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,015 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,015 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,016 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:18,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:18,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:18,039 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:18,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,047 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,048 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,048 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:18,057 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:18,057 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,064 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,064 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,065 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:18,075 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:18,076 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,084 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,085 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,085 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:18,094 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:18,094 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,102 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,102 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,102 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:18,106 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,107 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,114 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,115 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,115 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:18,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:18,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:18,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:18,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,149 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,149 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,150 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2020-06-22 10:43:18,163 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:18,164 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,172 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,172 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,173 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:18,183 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:18,183 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,190 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,190 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,191 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:18,199 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:18,200 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,207 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,207 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,207 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:18,211 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,211 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,219 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,219 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,220 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:18,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:18,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:18,247 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:18,247 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,255 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,255 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:18,265 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:18,266 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,274 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,275 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,275 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:18,281 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:18,281 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,291 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,292 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,292 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:18,297 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,297 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,308 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,309 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,309 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:18,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:18,340 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:18,340 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,351 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,351 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,351 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:18,356 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:18,356 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,367 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,367 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,367 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:18,372 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,373 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,384 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,384 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:18,391 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,391 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,402 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,403 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,403 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:18,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:18,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:18,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:43:18,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,444 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,444 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,445 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-06-22 10:43:18,449 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:18,450 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,460 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,461 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,461 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2020-06-22 10:43:18,466 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,466 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,481 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,481 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,481 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:18,487 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,488 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,499 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,499 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,499 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:43:18,504 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:18,504 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,515 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,515 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,515 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:43:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:18,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:18,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:18,544 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:18,545 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,555 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,555 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,555 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:18,567 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:18,567 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,577 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,577 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,578 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:18,582 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,582 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,593 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,593 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,593 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:18,601 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-06-22 10:43:18,601 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,612 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,613 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,613 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2020-06-22 10:43:18,618 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:18,618 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,628 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,629 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,629 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-06-22 10:43:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:18,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:43:18,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:18,658 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:18,659 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,668 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,668 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,668 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2020-06-22 10:43:18,679 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:18,679 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,697 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,698 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,698 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-06-22 10:43:18,703 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:43:18,703 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,712 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,713 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,713 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-06-22 10:43:18,720 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-06-22 10:43:18,720 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,731 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,731 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,731 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2020-06-22 10:43:18,735 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:43:18,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,744 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:18,744 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:18,744 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-06-22 10:43:18,747 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:43:18,747 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 8 loop predicates [2020-06-22 10:43:18,748 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 190 states and 217 transitions. cyclomatic complexity: 32 Second operand 8 states. [2020-06-22 10:43:19,162 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 190 states and 217 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 451 states and 496 transitions. Complement of second has 39 states. [2020-06-22 10:43:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 10:43:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:43:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2020-06-22 10:43:19,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 13 letters. Loop has 30 letters. [2020-06-22 10:43:19,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:19,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 43 letters. Loop has 30 letters. [2020-06-22 10:43:19,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:19,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 13 letters. Loop has 60 letters. [2020-06-22 10:43:19,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:19,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 496 transitions. [2020-06-22 10:43:19,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2020-06-22 10:43:19,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 246 states and 278 transitions. [2020-06-22 10:43:19,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-06-22 10:43:19,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2020-06-22 10:43:19,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 278 transitions. [2020-06-22 10:43:19,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:43:19,175 INFO L706 BuchiCegarLoop]: Abstraction has 246 states and 278 transitions. [2020-06-22 10:43:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 278 transitions. [2020-06-22 10:43:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 109. [2020-06-22 10:43:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-06-22 10:43:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2020-06-22 10:43:19,179 INFO L729 BuchiCegarLoop]: Abstraction has 109 states and 128 transitions. [2020-06-22 10:43:19,179 INFO L609 BuchiCegarLoop]: Abstraction has 109 states and 128 transitions. [2020-06-22 10:43:19,179 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 10:43:19,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 128 transitions. [2020-06-22 10:43:19,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:43:19,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:43:19,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:43:19,181 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:43:19,181 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:43:19,182 INFO L794 eck$LassoCheckResult]: Stem: 9966#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9964#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 9965#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9991#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9990#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 9989#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 9988#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9987#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9986#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 9985#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 9984#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9983#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 9982#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 9937#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 9938#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 9997#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 9952#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 9946#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 9947#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9959#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9957#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 9954#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 9955#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 10030#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9979#L10-7 [2020-06-22 10:43:19,183 INFO L796 eck$LassoCheckResult]: Loop: 9979#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 9975#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 9973#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9960#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 9961#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 9967#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 9969#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 9970#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 9945#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9958#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9956#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 9953#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 9948#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9949#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9979#L10-7 [2020-06-22 10:43:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:19,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1361998371, now seen corresponding path program 2 times [2020-06-22 10:43:19,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:19,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:19,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:43:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1927426560, now seen corresponding path program 9 times [2020-06-22 10:43:19,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:19,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:19,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:43:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash -633283422, now seen corresponding path program 2 times [2020-06-22 10:43:19,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:43:19,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:43:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:19,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:43:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:43:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:19,978 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2020-06-22 10:43:20,110 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-06-22 10:43:20,113 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:43:20,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:43:20,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:43:20,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:43:20,113 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:43:20,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:43:20,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:43:20,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:43:20,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Lasso [2020-06-22 10:43:20,114 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:43:20,114 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:43:20,116 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 10:43:20,118 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 10:43:20,119 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 10:43:20,120 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 10:43:20,122 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 10:43:20,126 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 10:43:20,128 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 10:43:20,380 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2020-06-22 10:43:20,497 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-06-22 10:43:20,498 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 10:43:20,499 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 10:43:20,501 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 10:43:20,503 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 10:43:20,505 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 10:43:20,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:43:20,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:43:20,853 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 10:43:20,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:43:20,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:43:20,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:43:20,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,855 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 10:43:20,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:43:20,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:43:20,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:43:20,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,856 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 10:43:20,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:43:20,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:43:20,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:43:20,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,858 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 10:43:20,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:43:20,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:43:20,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:43:20,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,859 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 10:43:20,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,864 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 10:43:20,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,866 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 10:43:20,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,870 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 10:43:20,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,874 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 10:43:20,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,876 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 10:43:20,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,880 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 10:43:20,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,884 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 10:43:20,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,888 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 10:43:20,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,898 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 10:43:20,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,902 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 10:43:20,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,904 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 10:43:20,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,908 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 10:43:20,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,915 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 10:43:20,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:43:20,917 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 10:43:20,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:43:20,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:43:20,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:43:20,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:43:20,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:43:20,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:43:20,926 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:43:20,930 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:43:20,930 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:43:20,931 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:43:20,931 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:43:20,932 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:43:20,932 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_12) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_12 Supporting invariants [] [2020-06-22 10:43:21,015 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:43:21,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:43:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:43:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:21,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:43:21,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:21,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:43:21,063 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:43:21,064 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,070 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,070 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,070 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2020-06-22 10:43:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:21,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:43:21,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:21,109 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:21,109 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,115 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,116 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,116 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:43:21,132 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:21,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,138 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,138 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,138 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:43:21,171 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 10:43:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:21,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:43:21,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:21,262 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:21,262 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,268 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,269 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,269 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:43:21,273 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:21,274 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,280 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,280 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,280 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:43:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:21,291 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:43:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:21,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:43:21,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:21,304 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:43:21,304 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,310 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,311 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,311 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:43:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:21,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:43:21,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:21,398 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:43:21,399 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,407 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,408 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,408 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:43:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:43:21,454 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:43:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:21,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:43:21,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:21,468 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:21,468 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,474 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,474 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,474 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:43:21,477 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:21,478 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,483 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:21,483 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:21,483 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 10:43:21,485 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:43:21,485 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates [2020-06-22 10:43:21,485 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 109 states and 128 transitions. cyclomatic complexity: 22 Second operand 8 states. [2020-06-22 10:43:22,241 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 109 states and 128 transitions. cyclomatic complexity: 22. Second operand 8 states. Result 3112 states and 3483 transitions. Complement of second has 681 states. [2020-06-22 10:43:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 3 stem states 18 non-accepting loop states 2 accepting loop states [2020-06-22 10:43:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:43:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 126 transitions. [2020-06-22 10:43:22,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 126 transitions. Stem has 24 letters. Loop has 14 letters. [2020-06-22 10:43:22,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:22,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 126 transitions. Stem has 38 letters. Loop has 14 letters. [2020-06-22 10:43:22,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:22,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 126 transitions. Stem has 24 letters. Loop has 28 letters. [2020-06-22 10:43:22,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:43:22,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3112 states and 3483 transitions. [2020-06-22 10:43:22,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:43:22,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3112 states to 0 states and 0 transitions. [2020-06-22 10:43:22,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:43:22,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:43:22,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:43:22,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:43:22,274 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:43:22,274 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:43:22,274 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:43:22,274 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-22 10:43:22,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:43:22,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:43:22,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:43:22,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:43:22 BasicIcfg [2020-06-22 10:43:22,282 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:43:22,283 INFO L168 Benchmark]: Toolchain (without parser) took 72866.80 ms. Allocated memory was 514.9 MB in the beginning and 1.0 GB in the end (delta: 524.3 MB). Free memory was 439.8 MB in the beginning and 375.6 MB in the end (delta: 64.2 MB). Peak memory consumption was 588.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:43:22,283 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:43:22,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.68 ms. Allocated memory is still 514.9 MB. Free memory was 439.1 MB in the beginning and 484.6 MB in the end (delta: -45.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:43:22,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.64 ms. Allocated memory is still 514.9 MB. Free memory was 484.6 MB in the beginning and 482.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:43:22,284 INFO L168 Benchmark]: Boogie Preprocessor took 23.32 ms. Allocated memory is still 514.9 MB. Free memory was 482.3 MB in the beginning and 480.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:43:22,285 INFO L168 Benchmark]: RCFGBuilder took 352.71 ms. Allocated memory is still 514.9 MB. Free memory was 480.2 MB in the beginning and 458.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 10:43:22,285 INFO L168 Benchmark]: BlockEncodingV2 took 155.35 ms. Allocated memory is still 514.9 MB. Free memory was 457.6 MB in the beginning and 446.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:43:22,285 INFO L168 Benchmark]: TraceAbstraction took 1665.05 ms. Allocated memory was 514.9 MB in the beginning and 557.3 MB in the end (delta: 42.5 MB). Free memory was 446.7 MB in the beginning and 419.8 MB in the end (delta: 26.9 MB). Peak memory consumption was 69.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:43:22,286 INFO L168 Benchmark]: BuchiAutomizer took 70341.20 ms. Allocated memory was 557.3 MB in the beginning and 1.0 GB in the end (delta: 481.8 MB). Free memory was 419.8 MB in the beginning and 375.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 526.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:43:22,288 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 56 edges - StatisticsResult: Encoded RCFG 43 locations, 80 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 284.68 ms. Allocated memory is still 514.9 MB. Free memory was 439.1 MB in the beginning and 484.6 MB in the end (delta: -45.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.64 ms. Allocated memory is still 514.9 MB. Free memory was 484.6 MB in the beginning and 482.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.32 ms. Allocated memory is still 514.9 MB. Free memory was 482.3 MB in the beginning and 480.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 352.71 ms. Allocated memory is still 514.9 MB. Free memory was 480.2 MB in the beginning and 458.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 155.35 ms. Allocated memory is still 514.9 MB. Free memory was 457.6 MB in the beginning and 446.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1665.05 ms. Allocated memory was 514.9 MB in the beginning and 557.3 MB in the end (delta: 42.5 MB). Free memory was 446.7 MB in the beginning and 419.8 MB in the end (delta: 26.9 MB). Peak memory consumption was 69.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 70341.20 ms. Allocated memory was 557.3 MB in the beginning and 1.0 GB in the end (delta: 481.8 MB). Free memory was 419.8 MB in the beginning and 375.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 526.0 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: 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: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: 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: 10]: 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: 10]: 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: 10]: 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: 17]: 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: 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 - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 10:43:22,294 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:43:22,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:43:22,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:43:22,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:43:22,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:43:22,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((d == 0 && \valid[y] == 1) && 1 == \valid[d]) && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0) && unknown-#length-unknown[d] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 22 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 270 SDslu, 88 SDs, 0 SdLazy, 462 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, 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, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 1659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (2 trivial, 0 deterministic, 12 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 22 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 34 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 23 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 70.3s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 16.1s. Construction of modules took 1.8s. Büchi inclusion checks took 52.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1177 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 190 states and ocurred in iteration 12. Nontrivial modules had stage [12, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/22 HoareTripleCheckerStatistics: 312 SDtfs, 2132 SDslu, 953 SDs, 0 SdLazy, 2476 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso12 LassoPreprocessingBenchmarks: Lassos: inital392 mio100 ax100 hnf100 lsp96 ukn63 mio100 lsp40 div100 bol100 ite100 ukn100 eq192 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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! !SESSION 2020-06-22 10:42:05.884 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:43:22.537 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check