YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:08:07,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:08:07,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:08:07,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:08:07,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:08:07,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:08:07,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:08:07,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:08:07,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:08:07,545 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:08:07,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:08:07,546 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:08:07,547 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:08:07,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:08:07,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:08:07,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:08:07,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:08:07,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:08:07,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:08:07,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:08:07,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:08:07,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:08:07,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:08:07,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:08:07,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:08:07,561 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:08:07,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:08:07,562 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:08:07,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:08:07,563 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:08:07,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:08:07,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:08:07,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:08:07,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:08:07,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:08:07,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:08:07,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:08:07,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:08:07,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:08:07,568 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:08:07,582 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:08:07,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:08:07,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:08:07,583 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:08:07,584 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:08:07,584 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:08:07,584 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:08:07,584 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:08:07,584 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:08:07,584 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:08:07,584 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:08:07,585 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:08:07,585 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:08:07,585 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:08:07,585 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:08:07,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:08:07,585 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:08:07,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:08:07,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:08:07,586 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:08:07,586 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:08:07,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:08:07,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:08:07,587 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:08:07,587 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:08:07,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:08:07,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:08:07,587 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:08:07,587 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:08:07,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:08:07,626 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:08:07,629 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:08:07,631 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:08:07,631 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:08:07,632 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:08:07,698 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a8a6a3f18fd740da8b53377b32544105/FLAGadc94005e [2020-06-22 10:08:08,043 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:08:08,044 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:08:08,044 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:08:08,050 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a8a6a3f18fd740da8b53377b32544105/FLAGadc94005e [2020-06-22 10:08:08,447 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a8a6a3f18fd740da8b53377b32544105 [2020-06-22 10:08:08,459 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:08:08,460 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:08:08,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:08:08,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:08:08,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:08:08,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695aecb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08, skipping insertion in model container [2020-06-22 10:08:08,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:08:08,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:08:08,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:08:08,728 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:08:08,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:08:08,764 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:08:08,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08 WrapperNode [2020-06-22 10:08:08,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:08:08,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:08:08,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:08:08,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:08:08,774 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:08:08" (1/1) ... [2020-06-22 10:08:08,783 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:08:08" (1/1) ... [2020-06-22 10:08:08,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:08:08,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:08:08,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:08:08,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:08:08,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:08:08,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:08:08,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:08:08,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:08:08,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (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:08:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:08:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:08:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:08:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:08:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:08:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:08:09,226 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:08:09,227 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:08:09,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09 BoogieIcfgContainer [2020-06-22 10:08:09,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:08:09,229 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:08:09,229 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:08:09,231 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:08:09,232 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09" (1/1) ... [2020-06-22 10:08:09,252 INFO L313 BlockEncoder]: Initial Icfg 77 locations, 81 edges [2020-06-22 10:08:09,253 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:08:09,254 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:08:09,255 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:08:09,255 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:08:09,257 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:08:09,258 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:08:09,258 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:08:09,295 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:08:09,337 INFO L200 BlockEncoder]: SBE split 41 edges [2020-06-22 10:08:09,342 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:08:09,344 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:08:09,383 INFO L100 BaseMinimizeStates]: Removed 24 edges and 12 locations by large block encoding [2020-06-22 10:08:09,386 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:08:09,387 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:08:09,388 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:08:09,388 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:08:09,389 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:08:09,389 INFO L313 BlockEncoder]: Encoded RCFG 64 locations, 114 edges [2020-06-22 10:08:09,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:08:09 BasicIcfg [2020-06-22 10:08:09,390 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:08:09,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:08:09,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:08:09,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:08:09,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:08:08" (1/4) ... [2020-06-22 10:08:09,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bea0c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:08:09, skipping insertion in model container [2020-06-22 10:08:09,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (2/4) ... [2020-06-22 10:08:09,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bea0c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:08:09, skipping insertion in model container [2020-06-22 10:08:09,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09" (3/4) ... [2020-06-22 10:08:09,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bea0c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:08:09, skipping insertion in model container [2020-06-22 10:08:09,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:08:09" (4/4) ... [2020-06-22 10:08:09,398 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:08:09,408 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:08:09,416 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2020-06-22 10:08:09,433 INFO L257 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2020-06-22 10:08:09,462 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:08:09,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:08:09,463 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:08:09,463 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:08:09,464 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:08:09,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:08:09,464 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:08:09,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:08:09,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:08:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-06-22 10:08:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:08:09,486 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:09,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:08:09,487 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION]=== [2020-06-22 10:08:09,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash 176376, now seen corresponding path program 1 times [2020-06-22 10:08:09,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:09,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:09,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:09,673 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:08:09,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:09,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:09,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:09,697 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2020-06-22 10:08:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:09,943 INFO L93 Difference]: Finished difference Result 64 states and 114 transitions. [2020-06-22 10:08:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:09,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:08:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:09,958 INFO L225 Difference]: With dead ends: 64 [2020-06-22 10:08:09,958 INFO L226 Difference]: Without dead ends: 57 [2020-06-22 10:08:09,962 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:08:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-06-22 10:08:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-06-22 10:08:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-06-22 10:08:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 100 transitions. [2020-06-22 10:08:10,004 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 100 transitions. Word has length 3 [2020-06-22 10:08:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,005 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 100 transitions. [2020-06-22 10:08:10,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 100 transitions. [2020-06-22 10:08:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:08:10,006 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:08:10,006 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash 176378, now seen corresponding path program 1 times [2020-06-22 10:08:10,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,048 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:08:10,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,051 INFO L87 Difference]: Start difference. First operand 57 states and 100 transitions. Second operand 3 states. [2020-06-22 10:08:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,194 INFO L93 Difference]: Finished difference Result 57 states and 100 transitions. [2020-06-22 10:08:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:08:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,195 INFO L225 Difference]: With dead ends: 57 [2020-06-22 10:08:10,195 INFO L226 Difference]: Without dead ends: 50 [2020-06-22 10:08:10,197 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:08:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-06-22 10:08:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-06-22 10:08:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-06-22 10:08:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 86 transitions. [2020-06-22 10:08:10,203 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 86 transitions. Word has length 3 [2020-06-22 10:08:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,203 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 86 transitions. [2020-06-22 10:08:10,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 86 transitions. [2020-06-22 10:08:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:08:10,204 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:08:10,205 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,205 INFO L82 PathProgramCache]: Analyzing trace with hash 5470376, now seen corresponding path program 1 times [2020-06-22 10:08:10,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,269 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:08:10,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,270 INFO L87 Difference]: Start difference. First operand 50 states and 86 transitions. Second operand 3 states. [2020-06-22 10:08:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,432 INFO L93 Difference]: Finished difference Result 50 states and 86 transitions. [2020-06-22 10:08:10,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:08:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,435 INFO L225 Difference]: With dead ends: 50 [2020-06-22 10:08:10,435 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 10:08:10,435 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:08:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 10:08:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 10:08:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 10:08:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2020-06-22 10:08:10,442 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 4 [2020-06-22 10:08:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,442 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 76 transitions. [2020-06-22 10:08:10,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 76 transitions. [2020-06-22 10:08:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:08:10,443 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:08:10,443 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 5470374, now seen corresponding path program 1 times [2020-06-22 10:08:10,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,477 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:08:10,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,479 INFO L87 Difference]: Start difference. First operand 45 states and 76 transitions. Second operand 3 states. [2020-06-22 10:08:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,579 INFO L93 Difference]: Finished difference Result 45 states and 76 transitions. [2020-06-22 10:08:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:08:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,581 INFO L225 Difference]: With dead ends: 45 [2020-06-22 10:08:10,581 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:08:10,581 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:08:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:08:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:08:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:08:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. [2020-06-22 10:08:10,586 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 4 [2020-06-22 10:08:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,587 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. [2020-06-22 10:08:10,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-06-22 10:08:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:08:10,587 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:10,588 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 169584223, now seen corresponding path program 1 times [2020-06-22 10:08:10,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,620 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:08:10,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,622 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 3 states. [2020-06-22 10:08:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,722 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-06-22 10:08:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:08:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,724 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:08:10,724 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 10:08:10,724 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:08:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 10:08:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 10:08:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:08:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. [2020-06-22 10:08:10,728 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 5 [2020-06-22 10:08:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,728 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. [2020-06-22 10:08:10,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2020-06-22 10:08:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:08:10,729 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:10,729 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash 169584225, now seen corresponding path program 1 times [2020-06-22 10:08:10,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,756 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:08:10,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,757 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. [2020-06-22 10:08:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,821 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2020-06-22 10:08:10,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:08:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,822 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:08:10,822 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 10:08:10,822 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:08:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 10:08:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 10:08:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:08:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-06-22 10:08:10,827 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 5 [2020-06-22 10:08:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,827 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-06-22 10:08:10,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-06-22 10:08:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:08:10,829 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:10,829 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash 169584226, now seen corresponding path program 1 times [2020-06-22 10:08:10,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,861 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:08:10,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,862 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2020-06-22 10:08:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,925 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2020-06-22 10:08:10,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:08:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,925 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:08:10,926 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:08:10,926 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:08:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:08:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:08:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:08:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:08:10,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 10:08:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,927 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:10,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:08:10,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:08:10,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:08:10,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,962 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2020-06-22 10:08:10,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:08:10,962 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-06-22 10:08:10,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:08:10,962 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,963 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point L23-6(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point L23-7(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point L23-8(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point L23-9(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point L23-11(lines 23 33) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:08:10,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:08:10,966 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2020-06-22 10:08:10,966 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 10:08:10,966 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2020-06-22 10:08:10,966 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 32) no Hoare annotation was computed. [2020-06-22 10:08:10,966 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,966 INFO L444 ceAbstractionStarter]: At program point L24-4(lines 23 33) the Hoare annotation is: (and (= ULTIMATE.start_main_~z~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~z~0.base) 4) (= (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) (= (select |#valid| ULTIMATE.start_main_~z~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) [2020-06-22 10:08:10,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:08:10,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:08:10,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:08:10,967 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2020-06-22 10:08:10,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:08:10,969 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2020-06-22 10:08:10,970 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2020-06-22 10:08:10,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:08:10,970 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:08:10,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:08:10 BasicIcfg [2020-06-22 10:08:10,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:08:10,990 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:08:10,990 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:08:10,993 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:08:10,994 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:08:08" (1/5) ... [2020-06-22 10:08:10,994 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366693ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,994 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,995 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (2/5) ... [2020-06-22 10:08:10,995 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366693ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,995 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,995 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09" (3/5) ... [2020-06-22 10:08:10,996 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366693ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:08:09" (4/5) ... [2020-06-22 10:08:10,996 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366693ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:08:10" (5/5) ... [2020-06-22 10:08:10,998 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:08:11,018 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:08:11,019 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:08:11,019 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:08:11,019 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:08:11,019 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:08:11,019 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:08:11,019 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:08:11,019 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:08:11,020 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:08:11,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. [2020-06-22 10:08:11,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:08:11,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:11,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:11,036 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:11,036 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:11,036 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:08:11,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. [2020-06-22 10:08:11,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:08:11,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:11,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:11,042 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:11,042 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:11,048 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [145] 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] 8#L-1true [233] L-1-->L19: 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_#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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.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|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_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_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, 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_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 26#L19true [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 43#L20true [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 9#L21true [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 44#L24-4true [2020-06-22 10:08:11,049 INFO L796 eck$LassoCheckResult]: Loop: 44#L24-4true [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 48#L23-1true [250] L23-1-->L23-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem6_3|) (not |v_ULTIMATE.start_main_#t~short8_2|)) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 47#L23-2true [169] L23-2-->L23-6: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 21#L23-6true [256] L23-6-->L23-7: Formula: (and (not |v_ULTIMATE.start_main_#t~short10_2|) (not |v_ULTIMATE.start_main_#t~short8_6|)) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 20#L23-7true [130] L23-7-->L23-11: Formula: (not |v_ULTIMATE.start_main_#t~short10_5|) InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_5|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_5|} AuxVars[] AssignedVars[] 32#L23-11true [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 65#L24true [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 63#L24-1true [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 61#L24-2true [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 5#L29true [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 4#L29-1true [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 28#L30true [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 59#L31true [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 42#L31-1true [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 44#L24-4true [2020-06-22 10:08:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 1 times [2020-06-22 10:08:11,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:11,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1052657779, now seen corresponding path program 1 times [2020-06-22 10:08:11,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:11,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:11,111 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:08:11,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:11,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:08:11,112 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:08:11,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:11,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:11,114 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2020-06-22 10:08:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:11,271 INFO L93 Difference]: Finished difference Result 66 states and 115 transitions. [2020-06-22 10:08:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:11,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 115 transitions. [2020-06-22 10:08:11,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:08:11,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 28 states and 39 transitions. [2020-06-22 10:08:11,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:08:11,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:08:11,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2020-06-22 10:08:11,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:08:11,280 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-06-22 10:08:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2020-06-22 10:08:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:08:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:08:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-06-22 10:08:11,283 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-06-22 10:08:11,283 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-06-22 10:08:11,283 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:08:11,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-06-22 10:08:11,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:08:11,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:11,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:11,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:11,285 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:08:11,285 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY [145] 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] 149#L-1 [233] L-1-->L19: 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_#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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.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|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_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_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, 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_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 150#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 146#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 147#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 140#L24-4 [2020-06-22 10:08:11,286 INFO L796 eck$LassoCheckResult]: Loop: 140#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 148#L23-1 [250] L23-1-->L23-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem6_3|) (not |v_ULTIMATE.start_main_#t~short8_2|)) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 151#L23-2 [169] L23-2-->L23-6: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 153#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 159#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 157#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 158#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 164#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 165#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 166#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 163#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 144#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 142#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 143#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 161#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 145#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 140#L24-4 [2020-06-22 10:08:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 2 times [2020-06-22 10:08:11,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:11,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1245620856, now seen corresponding path program 1 times [2020-06-22 10:08:11,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:11,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:11,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:08:11,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:11,323 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:08:11,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:11,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:08:11,324 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:08:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:11,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:11,324 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 10:08:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:11,368 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-06-22 10:08:11,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:11,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2020-06-22 10:08:11,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:08:11,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 36 transitions. [2020-06-22 10:08:11,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:08:11,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:08:11,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2020-06-22 10:08:11,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:08:11,371 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-06-22 10:08:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2020-06-22 10:08:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:08:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:08:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-06-22 10:08:11,373 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-06-22 10:08:11,373 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-06-22 10:08:11,373 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:08:11,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-06-22 10:08:11,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:08:11,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:11,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:11,375 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:11,375 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:11,376 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY [145] 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] 213#L-1 [233] L-1-->L19: 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_#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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.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|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_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_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, 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_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 214#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 210#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 211#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 204#L24-4 [2020-06-22 10:08:11,377 INFO L796 eck$LassoCheckResult]: Loop: 204#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 212#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 215#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 216#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, 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_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, 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_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 224#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 223#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 222#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 220#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 221#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 228#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 229#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 230#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 227#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 208#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 206#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 207#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 225#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 209#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 204#L24-4 [2020-06-22 10:08:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,377 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 3 times [2020-06-22 10:08:11,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:11,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:11,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:11,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash -979927020, now seen corresponding path program 1 times [2020-06-22 10:08:11,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:11,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:08:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1077025003, now seen corresponding path program 1 times [2020-06-22 10:08:11,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:11,708 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-06-22 10:08:12,027 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2020-06-22 10:08:12,137 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-06-22 10:08:12,151 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:08:12,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:08:12,152 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:08:12,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:08:12,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:08:12,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:08:12,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:08:12,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:08:12,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:08:12,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:08:12,154 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:08:12,172 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:08:12,178 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:08:12,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:12,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:12,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:12,184 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:08:12,189 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:08:12,191 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:08:12,193 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:08:12,195 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:08:12,196 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:08:12,198 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:08:12,199 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:08:12,481 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2020-06-22 10:08:12,603 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-06-22 10:08:12,603 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:08:12,606 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:08:12,608 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:08:12,610 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:08:12,611 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:08:12,613 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:08:12,614 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:08:12,616 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:08:13,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:08:13,023 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:08:13,025 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:08:13,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,033 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:08:13,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,036 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:08:13,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,038 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:08:13,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,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:08:13,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,043 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:08:13,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:13,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:13,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,050 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:08:13,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,052 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:08:13,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:13,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:13,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,058 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:08:13,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,061 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:08:13,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,063 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:08:13,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,079 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:08:13,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:13,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:13,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:13,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,083 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:08:13,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:13,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:13,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:13,096 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:08:13,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:13,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:13,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:13,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:13,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:13,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:13,108 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:08:13,114 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:08:13,114 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:08:13,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:08:13,118 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:08:13,118 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:08:13,119 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 Supporting invariants [] [2020-06-22 10:08:13,197 INFO L297 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:08:13,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:13,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:13,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:13,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:13,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:08:13,292 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:08:13,293 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,301 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,302 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,302 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2020-06-22 10:08:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:13,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:13,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:13,417 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 10:08:13,418 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,428 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,429 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:08:13,429 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:13,457 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:08:13,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,468 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,468 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:08:13,468 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-06-22 10:08:13,469 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:08:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:13,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:13,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:13,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, 0 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:08:13,639 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,649 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,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:08:13,650 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:13,656 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:08:13,656 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,669 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,669 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:08:13,670 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-06-22 10:08:13,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, 1 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:08:13,688 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,700 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,700 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:08:13,701 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2020-06-22 10:08:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:13,724 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:13,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:13,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:13,790 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 10:08:13,791 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,803 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,804 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:08:13,804 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 [2020-06-22 10:08:13,848 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:08:13,849 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,861 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,862 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:08:13,862 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:08:13,876 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 23 treesize of output 22 [2020-06-22 10:08:13,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,888 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,889 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:08:13,889 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:08:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:13,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:13,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:13,974 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 10:08:13,975 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:13,984 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:13,984 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:08:13,985 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 [2020-06-22 10:08:13,990 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:08:13,991 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,000 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,000 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:08:14,001 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:08:14,006 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 23 treesize of output 22 [2020-06-22 10:08:14,007 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,017 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,017 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:08:14,017 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:08:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:14,038 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:14,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:14,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:14,059 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:08:14,059 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,068 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,068 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:08:14,068 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-06-22 10:08:14,079 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:08:14,079 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,088 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,088 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:08:14,089 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2020-06-22 10:08:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:14,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:14,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:14,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, 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:08:14,118 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,129 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,129 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:08:14,130 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2020-06-22 10:08:14,145 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 10:08:14,146 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,157 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,158 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:08:14,158 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:14,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:14,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:14,179 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:08:14,180 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,189 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,189 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:08:14,190 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2020-06-22 10:08:14,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, 0 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:08:14,208 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,220 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,220 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:08:14,221 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:14,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 21 treesize of output 20 [2020-06-22 10:08:14,227 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:14,245 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:14,246 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:08:14,246 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-06-22 10:08:14,248 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 10:08:14,251 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 9 loop predicates [2020-06-22 10:08:14,252 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-06-22 10:08:15,582 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 494 states and 527 transitions. Complement of second has 119 states. [2020-06-22 10:08:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 5 stem states 25 non-accepting loop states 2 accepting loop states [2020-06-22 10:08:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:08:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 238 transitions. [2020-06-22 10:08:15,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 238 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 10:08:15,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:15,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 238 transitions. Stem has 23 letters. Loop has 18 letters. [2020-06-22 10:08:15,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:15,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 238 transitions. Stem has 5 letters. Loop has 36 letters. [2020-06-22 10:08:15,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:15,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 527 transitions. [2020-06-22 10:08:15,607 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 161 [2020-06-22 10:08:15,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 311 states and 330 transitions. [2020-06-22 10:08:15,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2020-06-22 10:08:15,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2020-06-22 10:08:15,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 330 transitions. [2020-06-22 10:08:15,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:08:15,612 INFO L706 BuchiCegarLoop]: Abstraction has 311 states and 330 transitions. [2020-06-22 10:08:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 330 transitions. [2020-06-22 10:08:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 78. [2020-06-22 10:08:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-06-22 10:08:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2020-06-22 10:08:15,620 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-06-22 10:08:15,620 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-06-22 10:08:15,620 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:08:15,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 89 transitions. [2020-06-22 10:08:15,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:08:15,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:15,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:15,622 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:15,622 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:15,623 INFO L794 eck$LassoCheckResult]: Stem: 1451#ULTIMATE.startENTRY [145] 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] 1427#L-1 [232] L-1-->L19: 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_#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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.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|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_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_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, 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_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 1428#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 1425#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 1426#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 1434#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1478#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1488#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1487#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, 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_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, 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_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1486#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1485#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1484#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 1483#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1482#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1481#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 1480#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1479#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1465#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 1418#L29 [2020-06-22 10:08:15,624 INFO L796 eck$LassoCheckResult]: Loop: 1418#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 1414#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 1415#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 1448#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 1420#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 1412#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1423#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1430#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1431#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, 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_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, 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_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1446#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1444#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1442#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 1438#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1439#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1454#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 1455#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1466#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1467#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 1418#L29 [2020-06-22 10:08:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1525648049, now seen corresponding path program 1 times [2020-06-22 10:08:15,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:15,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:15,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:15,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:15,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538802, now seen corresponding path program 2 times [2020-06-22 10:08:15,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:15,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1312599908, now seen corresponding path program 1 times [2020-06-22 10:08:15,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:15,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:15,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:08:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:15,913 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-06-22 10:08:16,357 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2020-06-22 10:08:16,491 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-06-22 10:08:16,495 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:08:16,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:08:16,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:08:16,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:08:16,496 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:08:16,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:08:16,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:08:16,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:08:16,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:08:16,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:08:16,496 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:08:16,500 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:08:16,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:08:16,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:08:16,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:08:16,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:08:16,802 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2020-06-22 10:08:16,908 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:08:16,910 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:08:16,911 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:08:16,914 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:08:16,915 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:08:16,917 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:08:16,918 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:08:16,920 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:08:16,921 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:08:16,923 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:08:16,924 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:08:16,926 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:08:16,928 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:08:16,929 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:08:17,349 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:08:17,349 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:08:17,350 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:08:17,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:17,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:17,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:17,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:17,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:17,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:17,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:17,354 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:08:17,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:17,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:17,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:17,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:17,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:17,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:17,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:17,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:17,356 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:08:17,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:17,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:17,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:17,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:17,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:17,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:17,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:17,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:17,358 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:08:17,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:17,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:17,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:17,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:17,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:17,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:17,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:17,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:17,361 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:08:17,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:17,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:17,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:17,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:17,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:17,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:17,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:17,369 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:08:17,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:17,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:17,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:17,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:17,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:17,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:17,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:17,376 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:08:17,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:17,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:17,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:17,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:17,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:17,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:17,389 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:08:17,394 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:08:17,395 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:08:17,395 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:08:17,396 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:08:17,396 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:08:17,396 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2020-06-22 10:08:17,472 INFO L297 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:08:17,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:17,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:17,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:17,523 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,524 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:08:17,524 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,531 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,532 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,532 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2020-06-22 10:08:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:17,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:17,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:17,584 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 10:08:17,585 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,594 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,595 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:08:17,595 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 [2020-06-22 10:08:17,620 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:08:17,621 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,629 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,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:08:17,629 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:08:17,634 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 23 treesize of output 22 [2020-06-22 10:08:17,635 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,644 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,644 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:08:17,644 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:08:17,688 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:08:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:17,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:17,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:17,812 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:08:17,812 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,821 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,822 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:08:17,822 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-06-22 10:08:17,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, 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:08:17,834 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,844 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,845 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:08:17,845 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2020-06-22 10:08:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:17,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:17,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:17,949 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:08:17,950 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,958 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,959 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:08:17,959 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2020-06-22 10:08:17,973 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 10:08:17,974 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:17,986 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:17,987 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:08:17,987 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:18,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:18,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:18,050 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:08:18,051 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,059 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,060 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:08:18,060 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2020-06-22 10:08:18,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 10:08:18,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,082 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,082 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:08:18,082 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:18,087 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:08:18,088 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,098 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,099 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:08:18,099 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-06-22 10:08:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:18,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:18,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:18,121 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 10:08:18,122 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,148 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,148 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:08:18,149 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:18,154 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:08:18,155 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,167 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,167 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:08:18,168 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-06-22 10:08:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:18,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:18,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:18,195 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 10:08:18,195 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,207 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,208 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:08:18,208 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08:18,216 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:08:18,216 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,227 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,227 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:08:18,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-06-22 10:08:18,233 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 23 treesize of output 22 [2020-06-22 10:08:18,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,248 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,249 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:08:18,249 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2020-06-22 10:08:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:18,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:18,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:18,276 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 10:08:18,277 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,290 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,291 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:08:18,291 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 [2020-06-22 10:08: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, 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:08:18,297 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,308 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08: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:08:18,309 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-06-22 10:08:18,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, 1 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:08:18,316 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,327 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,327 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:08:18,327 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2020-06-22 10:08:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:18,342 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:18,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:18,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:18,361 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 10:08:18,362 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,370 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,371 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:08:18,371 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 [2020-06-22 10:08:18,376 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:08:18,376 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,385 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,386 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:08:18,386 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:08: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, 1 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:08:18,391 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,400 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,401 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:08:18,401 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:08:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:18,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:08:18,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:18,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, 0 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:08:18,424 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,432 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,433 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:08:18,433 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 [2020-06-22 10:08:18,438 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:08:18,438 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,447 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,447 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:08:18,447 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-06-22 10:08:18,452 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 23 treesize of output 22 [2020-06-22 10:08:18,452 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:18,461 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:18,461 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:08:18,462 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2020-06-22 10:08:18,465 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 10:08:18,465 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 9 loop predicates [2020-06-22 10:08:18,466 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 78 states and 89 transitions. cyclomatic complexity: 13 Second operand 7 states. [2020-06-22 10:08:19,110 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 78 states and 89 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 557 states and 581 transitions. Complement of second has 96 states. [2020-06-22 10:08:19,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 13 non-accepting loop states 2 accepting loop states [2020-06-22 10:08:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:08:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 100 transitions. [2020-06-22 10:08:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 100 transitions. Stem has 18 letters. Loop has 18 letters. [2020-06-22 10:08:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 100 transitions. Stem has 36 letters. Loop has 18 letters. [2020-06-22 10:08:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 100 transitions. Stem has 18 letters. Loop has 36 letters. [2020-06-22 10:08:19,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:19,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 557 states and 581 transitions. [2020-06-22 10:08:19,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2020-06-22 10:08:19,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 557 states to 248 states and 265 transitions. [2020-06-22 10:08:19,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2020-06-22 10:08:19,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-06-22 10:08:19,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 265 transitions. [2020-06-22 10:08:19,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:08:19,130 INFO L706 BuchiCegarLoop]: Abstraction has 248 states and 265 transitions. [2020-06-22 10:08:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 265 transitions. [2020-06-22 10:08:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 88. [2020-06-22 10:08:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-06-22 10:08:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2020-06-22 10:08:19,136 INFO L729 BuchiCegarLoop]: Abstraction has 88 states and 100 transitions. [2020-06-22 10:08:19,136 INFO L609 BuchiCegarLoop]: Abstraction has 88 states and 100 transitions. [2020-06-22 10:08:19,136 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:08:19,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 100 transitions. [2020-06-22 10:08:19,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-06-22 10:08:19,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:19,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:19,138 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:08:19,138 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:19,139 INFO L794 eck$LassoCheckResult]: Stem: 2858#ULTIMATE.startENTRY [145] 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] 2833#L-1 [232] L-1-->L19: 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_#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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.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|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_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_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, 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_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 2834#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 2831#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 2832#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 2880#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2829#L23-1 [2020-06-22 10:08:19,140 INFO L796 eck$LassoCheckResult]: Loop: 2829#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2836#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2837#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, 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_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, 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_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2853#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2851#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2849#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 2845#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2846#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2861#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 2862#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2865#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2859#L24-2 [177] L24-2-->L25: Formula: (< |v_ULTIMATE.start_main_#t~mem12_4| |v_ULTIMATE.start_main_#t~mem11_4|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_4|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_4|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 2844#L25 [120] L25-->L25-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 2842#L25-1 [320] L25-1-->L26: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_15) (<= (+ v_ULTIMATE.start_main_~y~0.offset_15 4) (select |v_#length_44| v_ULTIMATE.start_main_~y~0.base_20)) (= (store |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20 (store (select |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20) v_ULTIMATE.start_main_~y~0.offset_15 |v_ULTIMATE.start_main_#t~mem13_6|)) |v_#memory_int_34|) (= 1 (select |v_#valid_56| v_ULTIMATE.start_main_~y~0.base_20))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 2843#L26 [322] L26-->L27: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 |v_ULTIMATE.start_main_#t~nondet14_5|))) (= (select |v_#valid_58| v_ULTIMATE.start_main_~x~0.base_26) 1)) InVars {ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_4|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14, #memory_int] 2819#L27 [153] L27-->L27-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_16) 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))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 2817#L27-1 [324] L27-1-->L24-4: Formula: (and (= (select |v_#valid_60| v_ULTIMATE.start_main_~z~0.base_24) 1) (= (store |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24 (store (select |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24) v_ULTIMATE.start_main_~z~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem15_6| (- 1)))) |v_#memory_int_42|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_18) (<= (+ v_ULTIMATE.start_main_~z~0.offset_18 4) (select |v_#length_48| v_ULTIMATE.start_main_~z~0.base_24))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_43|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_42|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 2818#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2879#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2878#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2877#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, 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_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, 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_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2876#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2875#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2874#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 2873#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2872#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2871#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 2870#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2868#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2869#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 2822#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 2823#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 2904#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 2903#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 2902#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 2901#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2900#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2899#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2898#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, 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_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, 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_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2897#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2896#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2895#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 2894#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2893#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2892#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 2864#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2866#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2860#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 2824#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 2820#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 2821#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 2856#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 2825#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 2826#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2829#L23-1 [2020-06-22 10:08:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash 967687202, now seen corresponding path program 1 times [2020-06-22 10:08:19,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:19,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:19,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -486376724, now seen corresponding path program 1 times [2020-06-22 10:08:19,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:19,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash 996815949, now seen corresponding path program 1 times [2020-06-22 10:08:19,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:19,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:19,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:21,114 WARN L188 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 175 DAG size of output: 170 [2020-06-22 10:08:21,420 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-06-22 10:08:21,729 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2020-06-22 10:08:21,883 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-06-22 10:08:21,887 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:08:21,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:08:21,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:08:21,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:08:21,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:08:21,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:08:21,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:08:21,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:08:21,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:08:21,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:08:21,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:08:21,891 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:08:21,894 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:08:21,895 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:08:21,897 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:08:21,900 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:08:21,901 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:08:21,903 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:08:21,904 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:08:21,906 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:08:21,913 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:08:21,915 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:08:21,917 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:08:21,919 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:08:21,920 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:08:21,922 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:08:22,184 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2020-06-22 10:08:22,325 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2020-06-22 10:08:22,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:22,328 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:08:22,329 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:08:22,331 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:08:22,333 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:08:22,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:08:22,714 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:08:22,714 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:08:22,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,718 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:08:22,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,721 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:08:22,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,724 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:08:22,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,728 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:08:22,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,730 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:08:22,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,732 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:08:22,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,734 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:08:22,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,736 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:08:22,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,740 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:08:22,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,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:08:22,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,744 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:08:22,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,748 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:08:22,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,750 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:08:22,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,752 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:08:22,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,762 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:08:22,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,791 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:08:22,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,797 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:08:22,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:22,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:22,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:22,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,800 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:08:22,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,803 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:08:22,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,809 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:08:22,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:22,815 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:08:22,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:22,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:22,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:22,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:22,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:22,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:22,828 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:08:22,833 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:08:22,833 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 10:08:22,833 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:08:22,834 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:08:22,835 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:08:22,835 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, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = -1*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_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 Supporting invariants [] [2020-06-22 10:08:22,947 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:08:22,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:22,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:22,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:08:22,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:23,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:08:23,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:23,045 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,045 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:23,050 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,064 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,065 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2020-06-22 10:08:23,128 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:23,128 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,133 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:23,134 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,151 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,152 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,152 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:08:23,198 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 27 [2020-06-22 10:08:23,199 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,207 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 27 [2020-06-22 10:08:23,207 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,230 INFO L497 ElimStorePlain]: treesize reduction 29, result has 40.8 percent of original size [2020-06-22 10:08:23,230 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:08:23,230 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:17 [2020-06-22 10:08:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-06-22 10:08:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:23,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:08:23,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:23,429 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,429 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:23,431 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,443 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,444 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,444 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2020-06-22 10:08:23,463 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:23,464 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,469 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:23,470 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,485 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,486 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,486 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:08:23,506 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 27 [2020-06-22 10:08:23,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,515 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 27 [2020-06-22 10:08:23,515 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,536 INFO L497 ElimStorePlain]: treesize reduction 29, result has 40.8 percent of original size [2020-06-22 10:08:23,537 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:08:23,537 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:17 [2020-06-22 10:08:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:23,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:08:23,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:23,585 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,585 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:23,587 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,598 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,598 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,599 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2020-06-22 10:08:23,614 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:23,614 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,618 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:23,619 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,633 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,634 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,634 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:08:23,655 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 27 [2020-06-22 10:08:23,656 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,662 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 27 [2020-06-22 10:08:23,663 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,682 INFO L497 ElimStorePlain]: treesize reduction 29, result has 40.8 percent of original size [2020-06-22 10:08:23,683 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:08:23,683 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:17 [2020-06-22 10:08:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:23,733 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:23,766 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:23,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:23,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:23,805 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,805 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 18 [2020-06-22 10:08:23,806 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,812 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,812 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,812 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 10:08:23,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:23,839 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,844 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:23,844 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,848 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:23,848 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,862 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,862 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:23,863 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:23,899 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 25 treesize of output 24 [2020-06-22 10:08:23,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,928 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:23,928 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:23,929 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,936 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 25 treesize of output 24 [2020-06-22 10:08:23,936 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:23,973 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:23,973 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:23,973 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:24,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:24,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:24,174 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,175 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 18 [2020-06-22 10:08:24,176 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,181 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,181 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,181 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 10:08:24,202 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:24,203 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,207 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:24,207 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,211 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:24,211 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,224 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,224 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:24,224 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:24,241 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 25 treesize of output 24 [2020-06-22 10:08:24,241 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:24,252 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,284 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,284 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:24,286 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,326 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:24,327 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,327 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:24,335 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:24,336 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:24,336 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,347 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:24,349 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,364 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,364 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,365 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:24,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:24,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:24,532 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:24,533 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,540 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,540 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,540 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:24,561 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:24,561 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,566 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:24,566 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:24,570 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,582 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,583 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:24,583 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:24,608 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,608 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:24,609 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:24,619 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,624 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 25 treesize of output 24 [2020-06-22 10:08:24,625 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,661 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:24,661 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,661 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:24,669 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:24,670 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:24,670 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,680 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,681 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:24,682 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,696 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,696 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,696 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:24,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:24,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:24,739 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,740 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 18 [2020-06-22 10:08:24,740 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,746 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,746 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,746 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 10:08:24,767 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:24,767 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,771 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:24,772 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,775 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:24,775 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,788 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,788 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:24,789 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:24,800 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,823 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,824 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:24,824 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,830 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 25 treesize of output 24 [2020-06-22 10:08:24,830 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,867 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:24,868 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,868 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:24,875 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:24,876 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:24,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,887 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,887 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:24,888 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:24,904 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,905 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,905 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:24,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:24,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:24,964 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,964 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:24,965 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,975 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:24,976 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:24,976 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:25,003 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,003 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,009 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:25,010 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,015 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,032 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,033 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:25,033 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:25,046 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 25 treesize of output 24 [2020-06-22 10:08:25,047 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,077 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,077 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:25,078 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,087 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 25 treesize of output 24 [2020-06-22 10:08:25,088 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,134 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:25,135 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,135 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:25,144 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:25,146 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:25,146 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,159 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,159 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:25,161 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,182 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,183 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,183 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:25,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:25,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:25,274 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,274 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:25,275 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,283 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,283 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:25,306 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:25,306 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,312 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,312 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,317 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,317 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,333 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,333 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:25,333 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:25,361 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,362 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:25,363 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:25,374 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,380 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 25 treesize of output 24 [2020-06-22 10:08:25,380 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,419 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:25,420 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,420 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:25,428 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:25,429 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:25,430 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,442 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,443 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:25,444 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,462 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,463 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:25,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:25,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:25,509 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,509 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:25,510 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,516 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,516 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,516 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:25,539 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,539 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,545 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:25,545 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,550 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,550 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,567 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,568 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:25,568 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:25,596 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,596 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:25,597 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,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 25 treesize of output 24 [2020-06-22 10:08:25,606 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,614 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 25 treesize of output 24 [2020-06-22 10:08:25,614 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,654 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:25,655 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,655 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:25,662 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:25,663 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:25,663 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,673 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,673 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:25,674 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,700 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,701 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,701 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:25,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:25,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:25,755 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,755 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:25,756 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,763 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,763 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,764 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:25,793 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,793 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,798 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:25,798 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,803 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:25,803 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,818 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,819 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:25,819 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:25,846 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,847 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:25,848 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,858 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 25 treesize of output 24 [2020-06-22 10:08:25,859 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,865 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 25 treesize of output 24 [2020-06-22 10:08:25,865 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,905 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:25,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,906 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:25,914 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:25,915 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:25,915 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,927 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,927 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:25,928 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:25,945 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,945 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,945 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:25,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:25,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:25,988 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,989 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:25,989 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,996 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:25,996 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:25,996 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:26,017 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:26,018 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,023 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,023 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,028 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,028 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,044 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,044 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:26,045 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:26,058 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,067 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 25 treesize of output 24 [2020-06-22 10:08:26,068 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,093 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:26,095 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,141 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:26,142 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,142 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:26,150 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:26,152 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:26,152 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,164 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,165 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:26,166 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,189 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,189 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,189 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:26,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:26,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:26,244 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,244 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:26,245 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,252 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,252 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,253 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:26,275 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,275 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,280 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:26,281 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,286 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,286 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,303 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,303 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:26,304 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:26,314 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 25 treesize of output 24 [2020-06-22 10:08:26,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,342 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:26,343 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,350 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 25 treesize of output 24 [2020-06-22 10:08:26,351 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,391 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:26,392 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,392 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:26,399 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:26,399 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:26,400 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,410 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,410 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:26,411 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,428 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,428 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,428 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:26,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:26,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:26,480 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,480 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 18 [2020-06-22 10:08:26,481 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,489 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,489 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,489 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 10:08:26,512 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,512 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,518 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,518 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,523 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:26,523 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,539 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,539 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:26,540 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:26,551 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 25 treesize of output 24 [2020-06-22 10:08:26,551 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:26,564 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,591 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,592 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:26,592 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,643 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:26,643 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,644 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:26,651 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:26,654 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:26,655 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,667 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,667 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:26,668 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,687 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,687 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,687 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:26,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:26,741 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,742 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 18 [2020-06-22 10:08:26,743 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,749 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,749 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,749 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 10:08:26,772 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:26,772 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,782 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,782 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,787 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,787 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,800 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,801 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:26,801 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:26,827 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,827 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:26,828 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,838 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 25 treesize of output 24 [2020-06-22 10:08:26,838 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,844 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 25 treesize of output 24 [2020-06-22 10:08:26,844 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,880 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:26,881 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,881 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:26,888 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:26,889 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:26,889 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,898 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,899 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:26,900 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,914 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,914 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,915 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:26,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:26,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:26,956 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:26,957 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,962 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:26,962 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:26,962 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:26,980 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,980 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:26,985 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:26,989 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:26,989 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,001 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,001 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:27,002 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:27,028 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,028 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:27,029 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:27,038 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,044 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 25 treesize of output 24 [2020-06-22 10:08:27,044 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,081 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:27,081 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,081 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:27,088 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:27,088 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:27,089 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,098 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,098 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:27,099 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,113 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,113 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,113 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:27,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:27,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:27,159 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,159 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 18 [2020-06-22 10:08:27,160 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,165 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,165 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,165 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 10:08:27,183 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:27,183 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,188 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,188 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,192 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,192 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,204 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,204 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:27,205 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:27,214 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 25 treesize of output 24 [2020-06-22 10:08:27,214 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,224 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 25 treesize of output 24 [2020-06-22 10:08:27,225 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,248 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:27,249 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,286 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:27,287 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,287 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:27,294 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:27,295 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:27,295 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,307 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,308 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:27,309 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,327 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,327 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,327 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:27,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:27,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:27,381 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,381 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:27,382 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,389 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,390 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,390 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:27,411 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,412 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,418 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,418 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,423 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:27,423 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,439 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,439 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:27,440 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:27,451 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 25 treesize of output 24 [2020-06-22 10:08:27,452 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,465 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 25 treesize of output 24 [2020-06-22 10:08:27,465 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,498 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,498 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:27,499 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,540 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:27,540 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,541 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:27,550 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:27,550 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:27,551 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,561 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,561 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:27,562 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,577 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,578 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,578 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:27,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:27,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:27,621 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,621 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:27,622 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,627 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,628 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,628 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:27,647 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,647 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,652 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:27,652 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,656 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,656 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,670 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,670 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:27,670 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:27,683 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 25 treesize of output 24 [2020-06-22 10:08:27,683 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,693 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 25 treesize of output 24 [2020-06-22 10:08:27,693 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,716 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,716 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:27,717 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,759 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:27,760 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,760 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:27,771 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:27,772 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:27,772 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,790 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,790 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:27,791 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,812 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,812 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,812 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:27,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:27,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:27,892 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,893 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:27,894 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,901 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,901 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:27,901 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:27,921 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:27,921 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,926 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,926 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,930 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:27,930 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,943 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,944 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:27,944 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:27,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 25 treesize of output 24 [2020-06-22 10:08:27,955 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,963 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 25 treesize of output 24 [2020-06-22 10:08:27,963 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:27,990 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:27,991 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,029 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:28,030 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,030 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:28,038 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:28,038 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:28,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,048 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,049 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:28,050 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,065 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,065 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:28,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:28,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:28,120 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,120 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:28,121 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,128 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,128 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,128 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:28,155 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:28,155 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,161 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,161 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,166 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,166 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,189 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,190 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:28,190 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:28,222 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,222 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:28,223 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,234 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 25 treesize of output 24 [2020-06-22 10:08:28,234 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,242 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 25 treesize of output 24 [2020-06-22 10:08:28,243 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,284 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:28,285 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,285 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:28,292 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:28,292 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:28,293 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,302 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,303 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:28,304 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,319 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,319 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,319 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:28,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:28,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:28,363 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,363 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:28,364 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,371 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,371 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,371 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:28,393 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:28,394 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,399 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,399 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,404 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,404 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,421 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,422 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:28,422 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:28,453 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,454 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:28,454 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,465 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 25 treesize of output 24 [2020-06-22 10:08:28,465 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,473 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 25 treesize of output 24 [2020-06-22 10:08:28,473 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,521 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:28,521 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,521 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:28,534 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:28,535 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:28,536 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,549 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,550 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:28,551 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,569 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,569 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,569 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:28,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:28,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:28,628 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,629 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 18 [2020-06-22 10:08:28,630 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,638 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,638 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,638 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 10:08:28,658 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,658 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,663 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,664 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,668 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:28,668 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,684 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,685 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:28,685 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:28,754 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,755 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:28,756 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:08:28,769 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,776 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 25 treesize of output 24 [2020-06-22 10:08:28,777 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,823 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:28,824 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,824 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:28,833 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:28,834 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:28,834 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,846 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,847 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:28,848 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,867 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,867 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:28,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:28,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:28,913 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,913 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 18 [2020-06-22 10:08:28,914 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,921 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,922 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:28,922 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 10:08:28,942 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,943 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,948 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:08:28,949 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,953 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:08:28,954 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:28,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:28,970 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:28,970 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2020-06-22 10:08:29,003 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:29,005 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,015 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 25 treesize of output 24 [2020-06-22 10:08:29,015 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,025 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 25 treesize of output 24 [2020-06-22 10:08:29,025 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,077 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:29,078 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,078 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:29,086 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:29,086 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:29,087 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,099 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,100 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:29,101 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,120 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,120 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:29,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:08:29,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:29,192 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,193 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 56 [2020-06-22 10:08:29,195 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,221 INFO L497 ElimStorePlain]: treesize reduction 35, result has 36.4 percent of original size [2020-06-22 10:08:29,221 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,221 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2020-06-22 10:08:29,241 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 25 treesize of output 24 [2020-06-22 10:08:29,242 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,264 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2020-06-22 10:08:29,284 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,290 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 25 treesize of output 24 [2020-06-22 10:08:29,291 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,330 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size [2020-06-22 10:08:29,330 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,330 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 [2020-06-22 10:08:29,337 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:29,338 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:29,338 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,348 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:29,349 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,363 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,363 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,364 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:29,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:08:29,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:29,448 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,448 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 10:08:29,451 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,495 INFO L497 ElimStorePlain]: treesize reduction 40, result has 41.2 percent of original size [2020-06-22 10:08:29,495 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,495 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2020-06-22 10:08:29,502 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 10:08:29,502 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 10:08:29,503 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,513 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,513 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:29,514 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,529 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,529 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,529 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 [2020-06-22 10:08:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:29,567 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:29,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:08:29,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:29,606 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,606 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2020-06-22 10:08:29,608 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,617 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,618 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,618 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2020-06-22 10:08:29,630 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:29,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,635 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-06-22 10:08:29,635 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:29,648 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:29,649 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:29,649 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:08:29,664 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 19 predicates after loop cannibalization [2020-06-22 10:08:29,665 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 19 loop predicates [2020-06-22 10:08:29,665 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 88 states and 100 transitions. cyclomatic complexity: 13 Second operand 8 states. [2020-06-22 10:08:31,184 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 88 states and 100 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 1172 states and 1209 transitions. Complement of second has 228 states. [2020-06-22 10:08:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 21 non-accepting loop states 2 accepting loop states [2020-06-22 10:08:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:08:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 156 transitions. [2020-06-22 10:08:31,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 156 transitions. Stem has 6 letters. Loop has 54 letters. [2020-06-22 10:08:31,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:31,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 156 transitions. Stem has 60 letters. Loop has 54 letters. [2020-06-22 10:08:31,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:31,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 156 transitions. Stem has 6 letters. Loop has 108 letters. [2020-06-22 10:08:31,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:31,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1172 states and 1209 transitions. [2020-06-22 10:08:31,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 10:08:31,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1172 states to 42 states and 49 transitions. [2020-06-22 10:08:31,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-06-22 10:08:31,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-06-22 10:08:31,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2020-06-22 10:08:31,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:08:31,214 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-06-22 10:08:31,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2020-06-22 10:08:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2020-06-22 10:08:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 10:08:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-06-22 10:08:31,216 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-06-22 10:08:31,216 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-06-22 10:08:31,216 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:08:31,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-06-22 10:08:31,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 10:08:31,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:31,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:31,217 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:08:31,217 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:31,218 INFO L794 eck$LassoCheckResult]: Stem: 8808#ULTIMATE.startENTRY [145] 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] 8806#L-1 [233] L-1-->L19: 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_#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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.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|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_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_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, 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_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 8801#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 8802#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 8803#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 8795#L24-4 [2020-06-22 10:08:31,218 INFO L796 eck$LassoCheckResult]: Loop: 8795#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 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_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 8804#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) 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~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 8807#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 8805#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, 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_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, 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_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 8800#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 8799#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 8798#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 8792#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 8793#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 8811#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 8812#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 8813#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 8809#L24-2 [177] L24-2-->L25: Formula: (< |v_ULTIMATE.start_main_#t~mem12_4| |v_ULTIMATE.start_main_#t~mem11_4|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_4|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_4|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 8810#L25 [120] L25-->L25-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 8814#L25-1 [320] L25-1-->L26: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_15) (<= (+ v_ULTIMATE.start_main_~y~0.offset_15 4) (select |v_#length_44| v_ULTIMATE.start_main_~y~0.base_20)) (= (store |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20 (store (select |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20) v_ULTIMATE.start_main_~y~0.offset_15 |v_ULTIMATE.start_main_#t~mem13_6|)) |v_#memory_int_34|) (= 1 (select |v_#valid_56| v_ULTIMATE.start_main_~y~0.base_20))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 8796#L26 [322] L26-->L27: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 |v_ULTIMATE.start_main_#t~nondet14_5|))) (= (select |v_#valid_58| v_ULTIMATE.start_main_~x~0.base_26) 1)) InVars {ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_4|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14, #memory_int] 8797#L27 [153] L27-->L27-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_16) 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))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 8794#L27-1 [324] L27-1-->L24-4: Formula: (and (= (select |v_#valid_60| v_ULTIMATE.start_main_~z~0.base_24) 1) (= (store |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24 (store (select |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24) v_ULTIMATE.start_main_~z~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem15_6| (- 1)))) |v_#memory_int_42|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_18) (<= (+ v_ULTIMATE.start_main_~z~0.offset_18 4) (select |v_#length_48| v_ULTIMATE.start_main_~z~0.base_24))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_43|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_42|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 8795#L24-4 [2020-06-22 10:08:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 4 times [2020-06-22 10:08:31,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:31,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1770492400, now seen corresponding path program 1 times [2020-06-22 10:08:31,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:31,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:08:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:31,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1867590383, now seen corresponding path program 1 times [2020-06-22 10:08:31,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:31,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:31,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:31,485 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2020-06-22 10:08:31,820 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2020-06-22 10:08:31,955 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-06-22 10:08:31,958 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:08:31,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:08:31,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:08:31,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:08:31,959 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:08:31,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:08:31,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:08:31,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:08:31,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 10:08:31,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:08:31,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:08:31,962 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:08:31,965 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:08:32,205 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-06-22 10:08:32,311 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:08:32,311 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:08:32,313 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:08:32,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:08:32,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:08:32,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:08:32,319 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:08:32,321 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:08:32,322 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:08:32,324 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:08:32,325 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:08:32,327 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:08:32,328 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:08:32,330 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:08:32,331 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:08:32,333 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:08:32,335 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:08:32,336 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:08:32,338 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:08:32,704 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:08:32,704 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:08:32,705 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:08:32,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,709 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:08:32,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,714 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:08:32,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,717 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:08:32,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,723 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:08:32,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,729 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:08:32,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,735 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:08:32,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,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:08:32,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,754 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:08:32,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:32,759 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:08:32,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:32,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:32,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:32,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:32,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:32,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:32,771 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:08:32,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:08:32,777 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:08:32,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:08:32,778 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:08:32,778 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:08:32,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4 - 1*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_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2020-06-22 10:08:32,861 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:08:32,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:32,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:32,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:32,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:08:32,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:32,904 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 14 treesize of output 12 [2020-06-22 10:08:32,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:32,910 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:32,910 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:08:32,910 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2020-06-22 10:08:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:32,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 10:08:32,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:33,093 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:33,093 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 88 [2020-06-22 10:08:33,098 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:33,145 INFO L497 ElimStorePlain]: treesize reduction 61, result has 43.5 percent of original size [2020-06-22 10:08:33,145 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:08:33,146 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2020-06-22 10:08:33,205 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:33,206 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2020-06-22 10:08:33,207 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:33,231 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:33,231 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2020-06-22 10:08:33,232 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:33,319 INFO L497 ElimStorePlain]: treesize reduction 32, result has 80.8 percent of original size [2020-06-22 10:08:33,320 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:33,320 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:121 [2020-06-22 10:08:33,437 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:08:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:34,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 10:08:34,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:34,119 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:34,119 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 88 [2020-06-22 10:08:34,126 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:34,171 INFO L497 ElimStorePlain]: treesize reduction 89, result has 34.6 percent of original size [2020-06-22 10:08:34,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:08:34,172 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2020-06-22 10:08:34,200 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:34,200 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2020-06-22 10:08:34,201 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:34,224 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:34,225 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2020-06-22 10:08:34,226 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:34,320 INFO L497 ElimStorePlain]: treesize reduction 32, result has 80.8 percent of original size [2020-06-22 10:08:34,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:34,321 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:121 [2020-06-22 10:08:34,365 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:34,366 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 87 [2020-06-22 10:08:34,369 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:34,383 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 0 case distinctions, treesize of input 50 treesize of output 45 [2020-06-22 10:08:34,383 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:34,396 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2020-06-22 10:08:34,397 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:34,426 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:34,426 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 87 [2020-06-22 10:08:34,429 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:34,615 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2020-06-22 10:08:34,616 INFO L497 ElimStorePlain]: treesize reduction 240, result has 33.1 percent of original size [2020-06-22 10:08:34,616 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:34,617 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:219, output treesize:101 [2020-06-22 10:08:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:34,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 10:08:34,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:35,213 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:35,213 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 85 [2020-06-22 10:08:35,217 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:35,255 INFO L497 ElimStorePlain]: treesize reduction 61, result has 39.6 percent of original size [2020-06-22 10:08:35,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:08:35,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:36 [2020-06-22 10:08:35,328 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:35,328 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 65 [2020-06-22 10:08:35,330 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:35,351 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:35,352 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 65 [2020-06-22 10:08:35,353 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:35,431 INFO L497 ElimStorePlain]: treesize reduction 32, result has 78.2 percent of original size [2020-06-22 10:08:35,431 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:35,431 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:101 [2020-06-22 10:08:35,676 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:35,676 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 84 [2020-06-22 10:08:35,679 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:35,721 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:35,721 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 84 [2020-06-22 10:08:35,724 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:35,737 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 0 case distinctions, treesize of input 47 treesize of output 42 [2020-06-22 10:08:35,737 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:35,744 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2020-06-22 10:08:35,745 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:35,905 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2020-06-22 10:08:35,905 INFO L497 ElimStorePlain]: treesize reduction 215, result has 33.6 percent of original size [2020-06-22 10:08:35,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 10:08:35,906 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:199, output treesize:92 [2020-06-22 10:08:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:36,243 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:36,255 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:36,267 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:36,279 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:36,291 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:36,303 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:36,303 INFO L98 LoopCannibalizer]: 25 predicates before loop cannibalization 35 predicates after loop cannibalization [2020-06-22 10:08:36,303 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 35 loop predicates [2020-06-22 10:08:36,303 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-06-22 10:08:41,676 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8. Second operand 13 states. Result 107 states and 115 transitions. Complement of second has 77 states. [2020-06-22 10:08:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 41 states 2 stem states 36 non-accepting loop states 3 accepting loop states [2020-06-22 10:08:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:08:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 83 transitions. [2020-06-22 10:08:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 83 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 10:08:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:41,679 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 10:08:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:41,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:08:41,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:41,717 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 14 treesize of output 12 [2020-06-22 10:08:41,718 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:41,723 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:41,723 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:08:41,723 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2020-06-22 10:08:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:41,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 10:08:41,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:41,893 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:41,894 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 88 [2020-06-22 10:08:41,898 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:41,942 INFO L497 ElimStorePlain]: treesize reduction 61, result has 43.5 percent of original size [2020-06-22 10:08:41,942 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:08:41,943 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2020-06-22 10:08:41,997 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:41,998 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2020-06-22 10:08:41,999 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:42,023 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:08:42,023 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2020-06-22 10:08:42,024 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:08:42,107 INFO L497 ElimStorePlain]: treesize reduction 32, result has 80.8 percent of original size [2020-06-22 10:08:42,108 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:08:42,108 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:121 [2020-06-22 10:08:42,219 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:08:42,219 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2020-06-22 10:08:42,220 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-06-22 10:08:42,423 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8. Second operand 13 states. Result 41 states and 49 transitions. Complement of second has 25 states. [2020-06-22 10:08:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2020-06-22 10:08:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:08:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2020-06-22 10:08:42,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 10:08:42,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:42,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2020-06-22 10:08:42,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:42,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2020-06-22 10:08:42,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:42,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2020-06-22 10:08:42,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:08:42,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-06-22 10:08:42,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:08:42,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:08:42,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:08:42,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:08:42,432 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:42,432 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:42,432 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:42,432 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:08:42,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:08:42,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:08:42,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:08:42,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:08:42 BasicIcfg [2020-06-22 10:08:42,440 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:08:42,440 INFO L168 Benchmark]: Toolchain (without parser) took 33981.12 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 470.3 MB). Free memory was 564.1 MB in the beginning and 664.6 MB in the end (delta: -100.4 MB). Peak memory consumption was 369.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,441 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:08:42,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.72 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 564.1 MB in the beginning and 651.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 688.4 MB. Free memory was 651.9 MB in the beginning and 649.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,442 INFO L168 Benchmark]: Boogie Preprocessor took 24.88 ms. Allocated memory is still 688.4 MB. Free memory was 649.2 MB in the beginning and 647.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,442 INFO L168 Benchmark]: RCFGBuilder took 397.68 ms. Allocated memory is still 688.4 MB. Free memory was 647.9 MB in the beginning and 618.7 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,442 INFO L168 Benchmark]: BlockEncodingV2 took 160.97 ms. Allocated memory is still 688.4 MB. Free memory was 618.7 MB in the beginning and 599.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,442 INFO L168 Benchmark]: TraceAbstraction took 1598.51 ms. Allocated memory is still 688.4 MB. Free memory was 598.5 MB in the beginning and 418.5 MB in the end (delta: 180.0 MB). Peak memory consumption was 180.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,443 INFO L168 Benchmark]: BuchiAutomizer took 31450.11 ms. Allocated memory was 688.4 MB in the beginning and 1.1 GB in the end (delta: 431.5 MB). Free memory was 418.5 MB in the beginning and 664.6 MB in the end (delta: -246.1 MB). Peak memory consumption was 185.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:42,445 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 77 locations, 81 edges - StatisticsResult: Encoded RCFG 64 locations, 114 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.72 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 564.1 MB in the beginning and 651.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 688.4 MB. Free memory was 651.9 MB in the beginning and 649.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.88 ms. Allocated memory is still 688.4 MB. Free memory was 649.2 MB in the beginning and 647.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 397.68 ms. Allocated memory is still 688.4 MB. Free memory was 647.9 MB in the beginning and 618.7 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 160.97 ms. Allocated memory is still 688.4 MB. Free memory was 618.7 MB in the beginning and 599.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1598.51 ms. Allocated memory is still 688.4 MB. Free memory was 598.5 MB in the beginning and 418.5 MB in the end (delta: 180.0 MB). Peak memory consumption was 180.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 31450.11 ms. Allocated memory was 688.4 MB in the beginning and 1.1 GB in the end (delta: 431.5 MB). Free memory was 418.5 MB in the beginning and 664.6 MB in the end (delta: -246.1 MB). Peak memory consumption was 185.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2020-06-22 10:08:42,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:42,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:42,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:42,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:42,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:42,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((z == 0 && \valid[y] == 1) && unknown-#length-unknown[z] == 4) && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && \valid[z] == 1) && 4 == unknown-#length-unknown[x]) && y == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 36 error locations. SAFE Result, 1.5s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 401 SDslu, 4 SDs, 0 SdLazy, 414 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 32 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] and consists of 25 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] + -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] and consists of 14 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 9.2s. Construction of modules took 1.8s. Büchi inclusion checks took 20.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 412 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 88 states and ocurred in iteration 4. Nontrivial modules had stage [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/44 HoareTripleCheckerStatistics: 162 SDtfs, 1436 SDslu, 991 SDs, 0 SdLazy, 2483 SolverSat, 388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1454 mio100 ax100 hnf100 lsp97 ukn40 mio100 lsp39 div100 bol100 ite100 ukn100 eq177 hnf89 smp92 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:08:05.216 ----------------------------------------------- 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:08:42.688 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check