YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:55:41,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:55:41,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:55:41,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:55:41,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:55:41,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:55:41,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:55:41,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:55:41,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:55:41,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:55:41,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:55:41,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:55:41,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:55:41,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:55:41,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:55:41,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:55:41,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:55:41,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:55:41,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:55:41,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:55:41,744 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:55:41,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:55:41,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:55:41,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:55:41,748 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:55:41,748 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:55:41,749 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:55:41,750 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:55:41,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:55:41,751 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:55:41,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:55:41,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:55:41,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:55:41,753 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:55:41,754 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:55:41,754 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:55:41,754 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:55:41,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:55:41,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:55:41,756 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 08:55:41,771 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:55:41,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:55:41,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:55:41,773 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:55:41,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:55:41,773 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:55:41,773 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:55:41,773 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:55:41,774 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:55:41,774 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:55:41,774 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:55:41,774 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:55:41,774 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:55:41,775 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:55:41,775 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:55:41,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:55:41,775 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:55:41,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:55:41,776 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:55:41,776 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:55:41,776 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:55:41,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:55:41,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:55:41,776 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:55:41,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:55:41,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:55:41,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:55:41,777 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:55:41,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:55:41,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:55:41,818 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:55:41,822 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:55:41,823 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:55:41,823 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:55:41,824 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:55:41,968 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/58462eb591b94d49b4e424a7fdf28a5a/FLAG6d765323c [2020-06-22 08:55:42,308 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:55:42,308 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:55:42,309 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:55:42,315 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/58462eb591b94d49b4e424a7fdf28a5a/FLAG6d765323c [2020-06-22 08:55:42,729 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/58462eb591b94d49b4e424a7fdf28a5a [2020-06-22 08:55:42,740 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:55:42,742 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:55:42,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:55:42,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:55:42,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:55:42,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:55:42" (1/1) ... [2020-06-22 08:55:42,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bd707d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:42, skipping insertion in model container [2020-06-22 08:55:42,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:55:42" (1/1) ... [2020-06-22 08:55:42,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:55:42,775 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:55:42,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:55:42,945 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:55:43,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:55:43,034 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:55:43,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43 WrapperNode [2020-06-22 08:55:43,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:55:43,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:55:43,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:55:43,035 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:55:43,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:55:43,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:55:43,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:55:43,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:55:43,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:55:43,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:55:43,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:55:43,097 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:55:43,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:55:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:55:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:55:43,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:55:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:55:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:55:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:55:43,402 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:55:43,402 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 08:55:43,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43 BoogieIcfgContainer [2020-06-22 08:55:43,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:55:43,404 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:55:43,405 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:55:43,407 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:55:43,407 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,425 INFO L313 BlockEncoder]: Initial Icfg 37 locations, 40 edges [2020-06-22 08:55:43,426 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:55:43,427 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:55:43,428 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:55:43,428 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:55:43,430 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:55:43,431 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:55:43,431 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:55:43,458 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:55:43,493 INFO L200 BlockEncoder]: SBE split 19 edges [2020-06-22 08:55:43,499 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 08:55:43,500 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:55:43,529 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 08:55:43,531 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 08:55:43,533 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:55:43,533 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:55:43,537 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 08:55:43,538 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:55:43,538 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:55:43,539 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:55:43,539 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:55:43,539 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:55:43,540 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 56 edges [2020-06-22 08:55:43,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:55:43 BasicIcfg [2020-06-22 08:55:43,541 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:55:43,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:55:43,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:55:43,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:55:43,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:55:42" (1/4) ... [2020-06-22 08:55:43,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ff89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:55:43, skipping insertion in model container [2020-06-22 08:55:43,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (2/4) ... [2020-06-22 08:55:43,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ff89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:55:43, skipping insertion in model container [2020-06-22 08:55:43,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43" (3/4) ... [2020-06-22 08:55:43,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ff89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:55:43, skipping insertion in model container [2020-06-22 08:55:43,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:55:43" (4/4) ... [2020-06-22 08:55:43,550 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:55:43,560 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:55:43,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-06-22 08:55:43,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-06-22 08:55:43,614 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:55:43,615 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:55:43,615 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:55:43,615 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:55:43,615 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:55:43,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:55:43,615 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:55:43,616 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:55:43,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:55:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-06-22 08:55:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:55:43,637 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:43,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:55:43,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash 129027, now seen corresponding path program 1 times [2020-06-22 08:55:43,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:43,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:43,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:43,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:43,823 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 08:55:43,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:43,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:43,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:43,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:43,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:43,846 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-06-22 08:55:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,004 INFO L93 Difference]: Finished difference Result 30 states and 56 transitions. [2020-06-22 08:55:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:55:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,019 INFO L225 Difference]: With dead ends: 30 [2020-06-22 08:55:44,019 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 08:55:44,024 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 08:55:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 08:55:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 08:55:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 08:55:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2020-06-22 08:55:44,063 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 48 transitions. Word has length 3 [2020-06-22 08:55:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,065 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 48 transitions. [2020-06-22 08:55:44,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 48 transitions. [2020-06-22 08:55:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:55:44,065 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:55:44,066 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash 129029, now seen corresponding path program 1 times [2020-06-22 08:55:44,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,109 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 08:55:44,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,112 INFO L87 Difference]: Start difference. First operand 26 states and 48 transitions. Second operand 3 states. [2020-06-22 08:55:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,199 INFO L93 Difference]: Finished difference Result 26 states and 48 transitions. [2020-06-22 08:55:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:55:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,201 INFO L225 Difference]: With dead ends: 26 [2020-06-22 08:55:44,201 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 08:55:44,202 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 08:55:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 08:55:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 08:55:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:55:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2020-06-22 08:55:44,207 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 40 transitions. Word has length 3 [2020-06-22 08:55:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,207 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 40 transitions. [2020-06-22 08:55:44,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 40 transitions. [2020-06-22 08:55:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:55:44,208 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:55:44,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash 3998668, now seen corresponding path program 1 times [2020-06-22 08:55:44,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,239 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 08:55:44,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,241 INFO L87 Difference]: Start difference. First operand 22 states and 40 transitions. Second operand 3 states. [2020-06-22 08:55:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,315 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2020-06-22 08:55:44,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:55:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,316 INFO L225 Difference]: With dead ends: 22 [2020-06-22 08:55:44,316 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 08:55:44,317 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 08:55:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 08:55:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 08:55:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 08:55:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2020-06-22 08:55:44,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 38 transitions. Word has length 4 [2020-06-22 08:55:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,321 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 38 transitions. [2020-06-22 08:55:44,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 38 transitions. [2020-06-22 08:55:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:55:44,321 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:55:44,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 3998670, now seen corresponding path program 1 times [2020-06-22 08:55:44,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,355 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 08:55:44,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,357 INFO L87 Difference]: Start difference. First operand 21 states and 38 transitions. Second operand 3 states. [2020-06-22 08:55:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,420 INFO L93 Difference]: Finished difference Result 21 states and 38 transitions. [2020-06-22 08:55:44,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:55:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,421 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:55:44,422 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:55:44,422 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 08:55:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:55:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 08:55:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:55:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2020-06-22 08:55:44,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 4 [2020-06-22 08:55:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,426 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. [2020-06-22 08:55:44,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. [2020-06-22 08:55:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:55:44,427 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:55:44,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 123959992, now seen corresponding path program 1 times [2020-06-22 08:55:44,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,470 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 08:55:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:55:44,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:55:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:55:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:55:44,471 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 4 states. [2020-06-22 08:55:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,593 INFO L93 Difference]: Finished difference Result 20 states and 36 transitions. [2020-06-22 08:55:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 08:55:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,594 INFO L225 Difference]: With dead ends: 20 [2020-06-22 08:55:44,595 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 08:55:44,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:55:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 08:55:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 08:55:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 08:55:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2020-06-22 08:55:44,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 5 [2020-06-22 08:55:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,599 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. [2020-06-22 08:55:44,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:55:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. [2020-06-22 08:55:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:55:44,599 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:55:44,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 123959994, now seen corresponding path program 1 times [2020-06-22 08:55:44,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,646 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 08:55:44,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,647 INFO L87 Difference]: Start difference. First operand 16 states and 28 transitions. Second operand 3 states. [2020-06-22 08:55:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,720 INFO L93 Difference]: Finished difference Result 16 states and 28 transitions. [2020-06-22 08:55:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:55:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,721 INFO L225 Difference]: With dead ends: 16 [2020-06-22 08:55:44,721 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:55:44,722 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 08:55:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:55:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:55:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:55:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:55:44,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 08:55:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,723 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:55:44,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:55:44,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:55:44,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:55:44,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:55:44,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:55:44,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:55:44,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:55:44,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:55:44,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:55:44,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:55:44,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:55:44,787 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,787 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 11) no Hoare annotation was computed. [2020-06-22 08:55:44,787 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-06-22 08:55:44,787 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 8 11) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~n~0.offset) (= (select |#length| ULTIMATE.start_main_~n~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4)) [2020-06-22 08:55:44,788 INFO L448 ceAbstractionStarter]: For program point L9-4(lines 9 11) no Hoare annotation was computed. [2020-06-22 08:55:44,788 INFO L444 ceAbstractionStarter]: At program point L7-4(lines 7 13) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~n~0.offset) (= (select |#length| ULTIMATE.start_main_~n~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4)) [2020-06-22 08:55:44,788 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 08:55:44,788 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:55:44,788 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 08:55:44,788 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 08:55:44,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 08:55:44,789 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 08:55:44,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 08:55:44,789 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 08:55:44,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 08:55:44,790 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,791 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:55:44,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:55:44 BasicIcfg [2020-06-22 08:55:44,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:55:44,818 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:55:44,818 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:55:44,822 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:55:44,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:55:42" (1/5) ... [2020-06-22 08:55:44,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fe84da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,823 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (2/5) ... [2020-06-22 08:55:44,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fe84da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43" (3/5) ... [2020-06-22 08:55:44,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fe84da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:55:43" (4/5) ... [2020-06-22 08:55:44,825 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fe84da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,825 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:55:44" (5/5) ... [2020-06-22 08:55:44,826 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:55:44,850 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:55:44,850 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:55:44,850 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:55:44,850 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:55:44,850 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:55:44,850 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:55:44,850 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:55:44,850 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:55:44,851 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:55:44,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 08:55:44,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:55:44,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:55:44,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:55:44,864 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:55:44,864 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:55:44,864 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:55:44,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 08:55:44,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:55:44,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:55:44,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:55:44,867 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:55:44,867 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:55:44,872 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [99] 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] 10#L-1true [127] L-1-->L7-4: 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|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 17#L7-4true [2020-06-22 08:55:44,873 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-4true [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4#L7-1true [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 22#L8true [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 5#L9-3true [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9#L9true [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 7#L9-1true [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3#L9-4true [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 13#L12true [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 17#L7-4true [2020-06-22 08:55:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash 4157, now seen corresponding path program 1 times [2020-06-22 08:55:44,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 1 times [2020-06-22 08:55:44,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1433032146, now seen corresponding path program 1 times [2020-06-22 08:55:44,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:45,251 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-06-22 08:55:45,333 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:55:45,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:55:45,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:55:45,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:55:45,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:55:45,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:55:45,336 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:55:45,336 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:55:45,336 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 08:55:45,336 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:55:45,336 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:55:45,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,634 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-06-22 08:55:45,752 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-06-22 08:55:45,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:46,149 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:55:46,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:55:46,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:55:46,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:46,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:46,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:46,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:46,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:46,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:46,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:46,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:46,165 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 08:55:46,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:46,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:46,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:46,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:46,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:46,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:46,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:46,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:46,168 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 08:55:46,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:46,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:46,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:46,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:46,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:46,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:46,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:46,175 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 08:55:46,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:46,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:46,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:46,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:46,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:46,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:46,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:46,190 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 08:55:46,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:46,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:46,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:46,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:46,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:46,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:46,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:46,196 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:55:46,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:55:46,202 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:55:46,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:55:46,204 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:55:46,204 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:55:46,205 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 Supporting invariants [] [2020-06-22 08:55:46,276 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:55:46,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:55:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:46,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:55:46,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:46,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:55:46,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:46,386 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:46,387 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 21 treesize of output 44 [2020-06-22 08:55:46,392 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,417 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:55:46,418 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,418 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:55:46,575 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 08:55:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:46,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:55:46,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:46,799 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:46,799 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 21 treesize of output 44 [2020-06-22 08:55:46,801 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,821 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:55:46,822 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,822 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:55:46,857 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:46,858 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 50 treesize of output 71 [2020-06-22 08:55:46,861 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,888 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:55:46,890 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:55:46,890 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:55:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:47,038 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:47,049 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:47,058 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:47,067 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:47,068 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:55:47,071 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 14 loop predicates [2020-06-22 08:55:47,072 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states. Second operand 8 states. [2020-06-22 08:55:50,821 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-06-22 08:55:51,243 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states.. Second operand 8 states. Result 184 states and 317 transitions. Complement of second has 31 states. [2020-06-22 08:55:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:55:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:55:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 188 transitions. [2020-06-22 08:55:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:55:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:55:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:55:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:51,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 317 transitions. [2020-06-22 08:55:51,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2020-06-22 08:55:51,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 64 states and 78 transitions. [2020-06-22 08:55:51,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 08:55:51,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-06-22 08:55:51,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 78 transitions. [2020-06-22 08:55:51,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:55:51,275 INFO L706 BuchiCegarLoop]: Abstraction has 64 states and 78 transitions. [2020-06-22 08:55:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 78 transitions. [2020-06-22 08:55:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2020-06-22 08:55:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:55:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-06-22 08:55:51,280 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:55:51,280 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:55:51,280 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:55:51,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-06-22 08:55:51,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-06-22 08:55:51,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:55:51,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:55:51,282 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:55:51,282 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:55:51,282 INFO L794 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY [99] 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] 458#L-1 [126] L-1-->L7-4: 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|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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|) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 459#L7-4 [2020-06-22 08:55:51,283 INFO L796 eck$LassoCheckResult]: Loop: 459#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 496#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 495#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 487#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 491#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 492#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 465#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 466#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 459#L7-4 [2020-06-22 08:55:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash 4156, now seen corresponding path program 1 times [2020-06-22 08:55:51,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:51,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:51,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 2 times [2020-06-22 08:55:51,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:51,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:51,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:51,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:51,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash 374422317, now seen corresponding path program 1 times [2020-06-22 08:55:51,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:51,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:51,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:55:51,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:51,561 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 08:55:51,620 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:55:51,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:55:51,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:55:51,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:55:51,621 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:55:51,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:55:51,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:55:51,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:55:51,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 08:55:51,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:55:51,621 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:55:51,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:51,839 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-06-22 08:55:52,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:55:52,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:55:52,280 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 08:55:52,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,283 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 08:55:52,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,286 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 08:55:52,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,291 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 08:55:52,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,293 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 08:55:52,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,295 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 08:55:52,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,298 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 08:55:52,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,300 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 08:55:52,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,303 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 08:55:52,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,307 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 08:55:52,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,310 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 08:55:52,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,319 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 08:55:52,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,329 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 08:55:52,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,343 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 08:55:52,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,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 08:55:52,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,363 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 08:55:52,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:52,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:52,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:52,367 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 08:55:52,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:52,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:52,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:52,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:52,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:52,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:52,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:52,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:55:52,374 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:55:52,374 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:55:52,375 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:55:52,375 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:55:52,375 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:55:52,375 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 Supporting invariants [] [2020-06-22 08:55:52,438 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:55:52,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:55:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:52,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:55:52,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:52,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:55:52,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:52,509 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:52,509 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 21 treesize of output 44 [2020-06-22 08:55:52,511 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:52,539 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:55:52,539 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:52,539 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:55:52,667 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 08:55:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:52,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:55:52,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:52,862 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:52,862 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 21 treesize of output 44 [2020-06-22 08:55:52,864 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:52,884 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:55:52,884 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:52,884 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:55:52,916 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:52,917 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 50 treesize of output 71 [2020-06-22 08:55:52,919 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:52,947 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:55:52,948 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:55:52,948 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:55:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:53,102 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:53,112 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:53,121 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:53,132 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:53,132 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:55:53,132 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 14 loop predicates [2020-06-22 08:55:53,132 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 08:55:54,564 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. [2020-06-22 08:55:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:55:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:55:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2020-06-22 08:55:54,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:55:54,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:54,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:55:54,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:54,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:55:54,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:54,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. [2020-06-22 08:55:54,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-06-22 08:55:54,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. [2020-06-22 08:55:54,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-06-22 08:55:54,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-06-22 08:55:54,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. [2020-06-22 08:55:54,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:55:54,577 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. [2020-06-22 08:55:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. [2020-06-22 08:55:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. [2020-06-22 08:55:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:55:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-06-22 08:55:54,580 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:55:54,580 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:55:54,581 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:55:54,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-06-22 08:55:54,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-06-22 08:55:54,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:55:54,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:55:54,582 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:55:54,583 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:55:54,583 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY [99] 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] 837#L-1 [125] L-1-->L7-4: 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_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 838#L7-4 [2020-06-22 08:55:54,583 INFO L796 eck$LassoCheckResult]: Loop: 838#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 869#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 867#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 868#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 874#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 872#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 871#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 870#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 838#L7-4 [2020-06-22 08:55:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:54,584 INFO L82 PathProgramCache]: Analyzing trace with hash 4155, now seen corresponding path program 1 times [2020-06-22 08:55:54,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:54,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:54,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:54,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:54,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 3 times [2020-06-22 08:55:54,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:54,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:54,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:54,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2113090516, now seen corresponding path program 1 times [2020-06-22 08:55:54,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:54,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:54,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:54,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:55:54,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:54,931 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 08:55:54,998 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:55:54,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:55:54,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:55:54,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:55:54,999 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:55:54,999 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:55:54,999 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:55:54,999 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:55:54,999 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 08:55:54,999 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:55:55,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:55:55,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,226 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-06-22 08:55:55,341 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-06-22 08:55:55,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:55,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:55:55,729 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:55:55,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 08:55:55,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,733 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 08:55:55,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:55,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:55,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,737 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 08:55:55,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,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 08:55:55,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,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 08:55:55,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,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 08:55:55,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,746 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 08:55:55,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,747 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 08:55:55,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:55,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:55,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,755 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 08:55:55,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:55,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:55,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,777 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 08:55:55,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:55,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:55,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,786 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 08:55:55,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:55,789 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 08:55:55,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:55,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:55,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:55,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:55,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:55,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:55,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:55,792 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:55:55,794 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:55:55,795 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:55:55,795 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:55:55,795 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:55:55,795 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:55:55,795 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3 Supporting invariants [] [2020-06-22 08:55:55,864 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:55:55,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:55:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:55,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:55:55,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:55,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:55:55,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:55,929 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:55,929 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 21 treesize of output 44 [2020-06-22 08:55:55,931 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:55,955 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:55:55,955 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:55,956 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:55:56,098 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 08:55:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:56,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:55:56,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:56,332 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:56,332 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 21 treesize of output 44 [2020-06-22 08:55:56,334 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:56,355 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:55:56,355 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:56,355 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:55:56,399 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:56,399 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 50 treesize of output 71 [2020-06-22 08:55:56,401 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:56,432 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:55:56,434 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:55:56,434 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:55:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:56,598 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:56,606 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:56,614 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:56,622 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:56,622 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:55:56,622 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 14 loop predicates [2020-06-22 08:55:56,623 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 08:55:59,030 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. [2020-06-22 08:55:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:55:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:55:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2020-06-22 08:55:59,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:55:59,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:59,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:55:59,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:59,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:55:59,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:59,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. [2020-06-22 08:55:59,038 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-06-22 08:55:59,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. [2020-06-22 08:55:59,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-06-22 08:55:59,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-06-22 08:55:59,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. [2020-06-22 08:55:59,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:55:59,041 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. [2020-06-22 08:55:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. [2020-06-22 08:55:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. [2020-06-22 08:55:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:55:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-06-22 08:55:59,044 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:55:59,045 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:55:59,045 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:55:59,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-06-22 08:55:59,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-06-22 08:55:59,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:55:59,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:55:59,046 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:55:59,046 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:55:59,046 INFO L794 eck$LassoCheckResult]: Stem: 1227#ULTIMATE.startENTRY [99] 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] 1216#L-1 [124] L-1-->L7-4: 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_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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|) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 1217#L7-4 [2020-06-22 08:55:59,047 INFO L796 eck$LassoCheckResult]: Loop: 1217#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1247#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1245#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1246#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1252#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1250#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 1249#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1248#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1217#L7-4 [2020-06-22 08:55:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:59,047 INFO L82 PathProgramCache]: Analyzing trace with hash 4154, now seen corresponding path program 1 times [2020-06-22 08:55:59,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:59,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:59,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:59,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:59,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 4 times [2020-06-22 08:55:59,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:59,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:59,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:59,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:59,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash -305636053, now seen corresponding path program 1 times [2020-06-22 08:55:59,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:59,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:59,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:55:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:59,361 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:55:59,361 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:55:59,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:55:59,362 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:55:59,362 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:55:59,362 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:55:59,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:55:59,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:55:59,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 08:55:59,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:55:59,362 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:55:59,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,608 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-06-22 08:55:59,717 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-06-22 08:55:59,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:59,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:00,102 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:00,103 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:00,103 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 08:56:00,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:00,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:00,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:00,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,106 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 08:56:00,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:00,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:00,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:00,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,108 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 08:56:00,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,111 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 08:56:00,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,114 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 08:56:00,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:00,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:00,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:00,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,116 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 08:56:00,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,123 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 08:56:00,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,134 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 08:56:00,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,141 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 08:56:00,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:56:00,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:56:00,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:00,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:00,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,175 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 08:56:00,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:00,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:00,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:00,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:00,178 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 08:56:00,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:00,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:00,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:00,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:00,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:00,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:00,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:00,181 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:00,182 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:56:00,182 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:56:00,182 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:00,183 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:56:00,183 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:00,183 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_4) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_4 Supporting invariants [] [2020-06-22 08:56:00,244 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:56:00,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:00,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:00,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:00,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:00,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:00,309 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:00,309 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 21 treesize of output 44 [2020-06-22 08:56:00,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:00,330 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:00,330 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:00,331 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:00,434 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 08:56:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:00,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:00,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:00,634 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2020-06-22 08:56:00,635 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:00,655 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:00,656 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:00,656 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:00,689 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:00,689 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 50 treesize of output 71 [2020-06-22 08:56:00,691 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:00,718 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:56:00,719 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:00,719 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:56:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:00,894 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:00,903 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:00,912 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:00,921 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:00,921 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:56:00,922 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 14 loop predicates [2020-06-22 08:56:00,922 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 08:56:01,997 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. [2020-06-22 08:56:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:56:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:56:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2020-06-22 08:56:01,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:56:01,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:01,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:56:01,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:01,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:56:02,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:02,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. [2020-06-22 08:56:02,006 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-06-22 08:56:02,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. [2020-06-22 08:56:02,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-06-22 08:56:02,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-06-22 08:56:02,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. [2020-06-22 08:56:02,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:56:02,008 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. [2020-06-22 08:56:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. [2020-06-22 08:56:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. [2020-06-22 08:56:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:56:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-06-22 08:56:02,012 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:02,012 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:02,012 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:56:02,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-06-22 08:56:02,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-06-22 08:56:02,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:02,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:02,014 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:56:02,014 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:02,014 INFO L794 eck$LassoCheckResult]: Stem: 1606#ULTIMATE.startENTRY [99] 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] 1595#L-1 [123] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 1596#L7-4 [2020-06-22 08:56:02,015 INFO L796 eck$LassoCheckResult]: Loop: 1596#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1627#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1625#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1626#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1632#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1630#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 1629#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1628#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1596#L7-4 [2020-06-22 08:56:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash 4153, now seen corresponding path program 1 times [2020-06-22 08:56:02,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:02,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:02,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 5 times [2020-06-22 08:56:02,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:02,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:02,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:02,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:02,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1501818410, now seen corresponding path program 1 times [2020-06-22 08:56:02,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:02,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:02,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:02,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:02,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:02,279 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-06-22 08:56:02,340 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:02,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:02,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:02,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:02,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:02,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:02,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:02,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:02,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 08:56:02,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:02,343 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:02,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:02,541 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-06-22 08:56:02,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:02,947 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:02,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:56:02,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,951 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 08:56:02,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,952 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 08:56:02,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,956 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 08:56:02,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,958 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 08:56:02,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,959 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 08:56:02,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,961 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 08:56:02,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,963 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 08:56:02,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,966 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 08:56:02,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,967 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 08:56:02,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,970 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 08:56:02,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,976 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 08:56:02,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:02,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:02,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:02,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,978 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 08:56:02,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,983 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 08:56:02,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,988 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 08:56:02,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:02,994 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 08:56:02,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:02,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:02,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:02,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:02,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:02,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:02,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:03,000 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 08:56:03,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:03,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:03,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:03,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:03,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:03,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:03,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:03,014 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 08:56:03,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:03,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:03,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:03,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:03,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:03,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:03,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:03,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:03,019 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:56:03,019 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:56:03,019 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:03,019 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:56:03,019 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:03,020 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_5) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_5 Supporting invariants [] [2020-06-22 08:56:03,079 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:56:03,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:03,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:03,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:03,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:03,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:03,134 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:03,134 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 21 treesize of output 44 [2020-06-22 08:56:03,135 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:03,155 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:03,156 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:03,156 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:03,271 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 08:56:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:03,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:03,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:03,460 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:03,460 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 21 treesize of output 44 [2020-06-22 08:56:03,462 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:03,482 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:03,482 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:03,483 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:03,518 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:03,519 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 50 treesize of output 71 [2020-06-22 08:56:03,521 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:03,550 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:56:03,551 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:03,552 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:56:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:03,721 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:03,729 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:03,738 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:03,746 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:03,746 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:56:03,746 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 14 loop predicates [2020-06-22 08:56:03,746 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 08:56:05,388 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. [2020-06-22 08:56:05,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:56:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:56:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2020-06-22 08:56:05,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:56:05,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:05,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:56:05,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:05,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:56:05,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:05,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. [2020-06-22 08:56:05,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-06-22 08:56:05,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. [2020-06-22 08:56:05,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-06-22 08:56:05,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-06-22 08:56:05,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. [2020-06-22 08:56:05,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:56:05,398 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. [2020-06-22 08:56:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. [2020-06-22 08:56:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. [2020-06-22 08:56:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:56:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-06-22 08:56:05,401 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:05,402 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:05,402 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 08:56:05,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-06-22 08:56:05,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-06-22 08:56:05,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:05,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:05,403 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:56:05,403 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:05,403 INFO L794 eck$LassoCheckResult]: Stem: 1985#ULTIMATE.startENTRY [99] 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] 1974#L-1 [122] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 1975#L7-4 [2020-06-22 08:56:05,404 INFO L796 eck$LassoCheckResult]: Loop: 1975#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2006#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2004#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2005#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2011#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2009#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 2008#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 2007#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1975#L7-4 [2020-06-22 08:56:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash 4152, now seen corresponding path program 1 times [2020-06-22 08:56:05,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:05,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:05,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 6 times [2020-06-22 08:56:05,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:05,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:05,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:05,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:05,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash -985694423, now seen corresponding path program 1 times [2020-06-22 08:56:05,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:05,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:05,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:05,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:05,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:05,677 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:05,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:05,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:05,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:05,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:05,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:05,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:05,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:05,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 08:56:05,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:05,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:05,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,889 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-06-22 08:56:05,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:05,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:06,317 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:06,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:06,318 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 08:56:06,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:06,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:06,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:06,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,320 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 08:56:06,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:06,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:06,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,323 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 08:56:06,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:06,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:06,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:06,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,325 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 08:56:06,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:06,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:06,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:06,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,326 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 08:56:06,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:06,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:06,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:06,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,328 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 08:56:06,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:06,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:06,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,330 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 08:56:06,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:06,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:06,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:06,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,332 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 08:56:06,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:06,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:06,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:06,337 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 08:56:06,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:06,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:06,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:06,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:06,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:06,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:06,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:06,340 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:06,341 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:56:06,341 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:56:06,342 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:06,342 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:56:06,342 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:06,342 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_6) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_6 Supporting invariants [] [2020-06-22 08:56:06,397 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:56:06,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:06,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:06,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:06,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:06,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:06,442 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:06,442 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 21 treesize of output 44 [2020-06-22 08:56:06,443 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:06,461 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:06,462 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:06,462 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:06,565 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 08:56:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:06,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:06,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:06,758 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:06,759 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 21 treesize of output 44 [2020-06-22 08:56:06,760 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:06,779 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:06,780 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:06,780 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:06,813 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:06,814 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 50 treesize of output 71 [2020-06-22 08:56:06,815 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:06,842 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:56:06,843 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:06,843 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:56:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:06,983 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:06,991 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:06,999 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:07,007 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:07,008 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:56:07,008 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 14 loop predicates [2020-06-22 08:56:07,008 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 08:56:08,062 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. [2020-06-22 08:56:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:56:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:56:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2020-06-22 08:56:08,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:56:08,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:08,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:56:08,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:08,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:56:08,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:08,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. [2020-06-22 08:56:08,069 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-06-22 08:56:08,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. [2020-06-22 08:56:08,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-06-22 08:56:08,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-06-22 08:56:08,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. [2020-06-22 08:56:08,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:56:08,071 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. [2020-06-22 08:56:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. [2020-06-22 08:56:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. [2020-06-22 08:56:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:56:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-06-22 08:56:08,074 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:08,074 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:08,074 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 08:56:08,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-06-22 08:56:08,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-06-22 08:56:08,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:08,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:08,075 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:56:08,075 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:08,076 INFO L794 eck$LassoCheckResult]: Stem: 2364#ULTIMATE.startENTRY [99] 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] 2353#L-1 [121] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 2354#L7-4 [2020-06-22 08:56:08,076 INFO L796 eck$LassoCheckResult]: Loop: 2354#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2386#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2384#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2385#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2391#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2389#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 2388#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 2387#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 2354#L7-4 [2020-06-22 08:56:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash 4151, now seen corresponding path program 1 times [2020-06-22 08:56:08,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:08,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:08,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 7 times [2020-06-22 08:56:08,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:08,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:08,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash 821760040, now seen corresponding path program 1 times [2020-06-22 08:56:08,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:08,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:08,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:08,329 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-06-22 08:56:08,391 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:08,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:08,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:08,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:08,391 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:08,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:08,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:08,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:08,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 08:56:08,392 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:08,392 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:08,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,574 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-06-22 08:56:08,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:08,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:08,999 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:09,000 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 08:56:09,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:09,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:09,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:09,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:09,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:09,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:09,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:09,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:09,002 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 08:56:09,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:09,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:09,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:09,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:09,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:09,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:09,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:09,007 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 08:56:09,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:09,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:09,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:09,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:09,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:09,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:09,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:09,012 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 08:56:09,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:09,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:09,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:09,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:09,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:09,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:09,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:09,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:09,014 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 08:56:09,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:09,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:09,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:09,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:09,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:09,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:09,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:09,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:56:09,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:09,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:09,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:09,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:09,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:09,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:09,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:09,029 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:09,031 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:56:09,031 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:56:09,032 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:09,032 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:56:09,032 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:09,032 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_7 Supporting invariants [] [2020-06-22 08:56:09,090 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:56:09,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:09,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:09,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:09,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:09,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:09,136 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:09,136 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 21 treesize of output 44 [2020-06-22 08:56:09,137 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:09,156 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:09,156 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:09,156 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:09,273 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 08:56:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:09,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:09,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:09,468 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:09,468 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2020-06-22 08:56:09,469 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:09,489 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:09,490 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:09,490 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:09,523 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:09,524 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 50 treesize of output 71 [2020-06-22 08:56:09,525 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:09,561 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:56:09,562 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:09,562 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:56:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:09,718 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:09,726 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:09,734 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:09,742 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:09,742 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:56:09,742 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 14 loop predicates [2020-06-22 08:56:09,742 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 08:56:12,058 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. [2020-06-22 08:56:12,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:56:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:56:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2020-06-22 08:56:12,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:56:12,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:12,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:56:12,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:12,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:56:12,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:12,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. [2020-06-22 08:56:12,066 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-06-22 08:56:12,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. [2020-06-22 08:56:12,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-06-22 08:56:12,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-06-22 08:56:12,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. [2020-06-22 08:56:12,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:56:12,067 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. [2020-06-22 08:56:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. [2020-06-22 08:56:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. [2020-06-22 08:56:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:56:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-06-22 08:56:12,070 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:12,070 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-06-22 08:56:12,070 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 08:56:12,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-06-22 08:56:12,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-06-22 08:56:12,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:12,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:12,071 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:56:12,072 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:12,072 INFO L794 eck$LassoCheckResult]: Stem: 2743#ULTIMATE.startENTRY [99] 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] 2732#L-1 [128] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 2733#L7-4 [2020-06-22 08:56:12,072 INFO L796 eck$LassoCheckResult]: Loop: 2733#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2765#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2763#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2764#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2770#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2768#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 2767#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 2766#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 2733#L7-4 [2020-06-22 08:56:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 4158, now seen corresponding path program 1 times [2020-06-22 08:56:12,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:12,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:12,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:12,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 8 times [2020-06-22 08:56:12,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:12,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:12,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1054480687, now seen corresponding path program 1 times [2020-06-22 08:56:12,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:12,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:12,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:12,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:12,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:12,353 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 08:56:12,414 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:12,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:12,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:12,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:12,414 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:12,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:12,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:12,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:12,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 08:56:12,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:12,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:12,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:12,625 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-06-22 08:56:13,042 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:13,043 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56: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 08:56:13,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,045 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 08:56:13,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,048 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 08:56:13,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56: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 08:56:13,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56: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 08:56:13,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,054 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 08:56:13,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,056 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 08:56:13,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56: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 08:56:13,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,060 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 08:56:13,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,062 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 08:56:13,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,064 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 08:56:13,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,069 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 08:56:13,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,073 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 08:56:13,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,080 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 08:56:13,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56: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 08:56:13,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:13,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:13,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:13,087 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 08:56:13,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:13,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:13,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:13,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:13,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:13,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:13,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:13,090 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:13,092 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 08:56:13,092 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:56:13,092 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:13,092 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:56:13,092 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:13,093 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_8) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_8 Supporting invariants [] [2020-06-22 08:56:13,155 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:56:13,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:13,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:13,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:13,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:13,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:13,201 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:13,201 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 21 treesize of output 44 [2020-06-22 08:56:13,202 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:13,222 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:13,223 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:13,223 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:13,329 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 08:56:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:13,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:56:13,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:13,535 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:13,535 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 21 treesize of output 44 [2020-06-22 08:56:13,536 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:13,556 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 08:56:13,557 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:13,557 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2020-06-22 08:56:13,594 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:13,594 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 50 treesize of output 71 [2020-06-22 08:56:13,596 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:13,634 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size [2020-06-22 08:56:13,635 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:13,635 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-06-22 08:56:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:13,797 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:13,805 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:13,813 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:13,821 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:13,821 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 08:56:13,822 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 14 loop predicates [2020-06-22 08:56:13,822 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 08:56:16,267 WARN L188 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-06-22 08:56:16,510 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 86 states and 105 transitions. Complement of second has 31 states. [2020-06-22 08:56:16,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 08:56:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:56:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2020-06-22 08:56:16,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:56:16,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:16,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 08:56:16,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:16,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 08:56:16,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:16,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 105 transitions. [2020-06-22 08:56:16,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2020-06-22 08:56:16,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 102 transitions. [2020-06-22 08:56:16,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 08:56:16,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-06-22 08:56:16,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 102 transitions. [2020-06-22 08:56:16,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:56:16,518 INFO L706 BuchiCegarLoop]: Abstraction has 84 states and 102 transitions. [2020-06-22 08:56:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 102 transitions. [2020-06-22 08:56:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 32. [2020-06-22 08:56:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:56:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-06-22 08:56:16,520 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-06-22 08:56:16,520 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-06-22 08:56:16,520 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 08:56:16,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2020-06-22 08:56:16,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 08:56:16,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:16,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:16,522 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 08:56:16,522 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:16,522 INFO L794 eck$LassoCheckResult]: Stem: 3111#ULTIMATE.startENTRY [99] 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] 3101#L-1 [127] L-1-->L7-4: 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|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 3102#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3112#L7-1 [2020-06-22 08:56:16,523 INFO L796 eck$LassoCheckResult]: Loop: 3112#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3113#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 3116#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3117#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3122#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3103#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 3104#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 3125#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3128#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3127#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3107#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 3108#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 3120#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3112#L7-1 [2020-06-22 08:56:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash 128954, now seen corresponding path program 1 times [2020-06-22 08:56:16,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:16,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:16,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:16,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:16,534 INFO L82 PathProgramCache]: Analyzing trace with hash -422344952, now seen corresponding path program 1 times [2020-06-22 08:56:16,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:16,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:16,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:16,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -415128593, now seen corresponding path program 1 times [2020-06-22 08:56:16,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:16,844 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-06-22 08:56:16,919 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:16,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:16,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:16,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:16,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:16,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:16,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:16,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:16,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso [2020-06-22 08:56:16,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:16,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:16,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 08:56: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 08:56:17,133 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-06-22 08:56:17,255 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-06-22 08:56:17,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:17,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:17,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:17,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:17,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:17,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:17,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:17,695 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:17,696 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:17,696 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 08:56:17,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:17,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:17,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:17,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:17,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:17,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:17,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:17,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:17,698 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 08:56:17,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:17,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:17,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:17,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:17,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:17,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:17,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:17,703 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 08:56:17,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:17,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:17,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:17,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:17,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:17,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:17,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:17,707 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 08:56:17,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:17,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:17,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:17,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:17,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:17,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:17,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:17,711 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 08:56:17,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:17,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:17,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:17,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:17,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:17,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:17,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:17,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 08:56:17,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:17,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:17,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:17,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:17,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:17,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:17,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:17,726 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 08:56:17,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:17,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:17,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:17,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:17,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:17,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:17,737 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:17,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:56:17,743 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:56:17,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:17,745 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:56:17,745 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:17,745 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_9) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_9 + 1 Supporting invariants [] [2020-06-22 08:56:17,812 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:56:17,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:17,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:17,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:17,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:56:17,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:17,878 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:17,879 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 23 treesize of output 46 [2020-06-22 08:56:17,881 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:17,910 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2020-06-22 08:56:17,911 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:17,911 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 [2020-06-22 08:56:18,511 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-06-22 08:56:18,545 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:18,545 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 39 treesize of output 68 [2020-06-22 08:56:18,547 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:18,553 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 41 treesize of output 29 [2020-06-22 08:56:18,554 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:18,620 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size [2020-06-22 08:56:18,622 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:18,622 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 [2020-06-22 08:56:19,059 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-06-22 08:56:19,890 WARN L188 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2020-06-22 08:56:20,276 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-06-22 08:56:20,386 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:20,386 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 1 case distinctions, treesize of input 56 treesize of output 39 [2020-06-22 08:56:20,387 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:20,393 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 56 treesize of output 39 [2020-06-22 08:56:20,394 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:20,419 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:20,420 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:20,420 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:113, output treesize:75 [2020-06-22 08:56:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:22,285 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 21 [2020-06-22 08:56:22,651 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (+ (* 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset)) c_oldRank0)) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33))))) is different from true [2020-06-22 08:56:23,252 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_35 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (or .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_35)) (or (= 0 v_arrayElimCell_35) (not .cse0)) (<= 1 (+ (* 2 v_arrayElimCell_35) c_oldRank0))))) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33))))) is different from true [2020-06-22 08:56:24,367 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (<= .cse0 1) (not (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset))))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse1 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base)) (<= .cse1 1)))) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33))))) is different from true [2020-06-22 08:56:25,373 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base)) (<= .cse0 1)))) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse1 (select (select |c_#memory_int| v_prenex_1) v_prenex_2))) (and (not (= v_prenex_2 c_ULTIMATE.start_main_~i~0.offset)) (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (<= .cse1 1))))) is different from true [2020-06-22 08:56:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,550 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,563 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,574 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,585 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,598 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,609 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,620 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:25,632 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:25,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:56:25,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:25,662 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 [2020-06-22 08:56:25,664 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:25,687 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2020-06-22 08:56:25,688 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:25,688 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 [2020-06-22 08:56:25,765 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:25,765 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 39 treesize of output 68 [2020-06-22 08:56:25,768 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:25,775 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 41 treesize of output 29 [2020-06-22 08:56:25,775 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:25,839 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size [2020-06-22 08:56:25,841 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:25,841 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 [2020-06-22 08:56:26,028 INFO L98 LoopCannibalizer]: 19 predicates before loop cannibalization 19 predicates after loop cannibalization [2020-06-22 08:56:26,028 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 08:56:26,028 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 44 transitions. cyclomatic complexity: 14 Second operand 11 states. [2020-06-22 08:56:26,288 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-06-22 08:56:26,451 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-06-22 08:56:26,886 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-06-22 08:56:27,048 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-06-22 08:56:27,583 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 44 transitions. cyclomatic complexity: 14. Second operand 11 states. Result 105 states and 127 transitions. Complement of second has 41 states. [2020-06-22 08:56:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2020-06-22 08:56:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 08:56:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 50 transitions. [2020-06-22 08:56:27,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 3 letters. Loop has 13 letters. [2020-06-22 08:56:27,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:27,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 16 letters. Loop has 13 letters. [2020-06-22 08:56:27,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:27,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 3 letters. Loop has 26 letters. [2020-06-22 08:56:27,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:27,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 127 transitions. [2020-06-22 08:56:27,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 08:56:27,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 78 states and 96 transitions. [2020-06-22 08:56:27,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-06-22 08:56:27,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 08:56:27,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 96 transitions. [2020-06-22 08:56:27,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:56:27,592 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. [2020-06-22 08:56:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 96 transitions. [2020-06-22 08:56:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2020-06-22 08:56:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-06-22 08:56:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2020-06-22 08:56:27,595 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. [2020-06-22 08:56:27,595 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. [2020-06-22 08:56:27,595 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 08:56:27,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 77 transitions. [2020-06-22 08:56:27,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 08:56:27,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:27,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:27,597 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:56:27,597 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:27,597 INFO L794 eck$LassoCheckResult]: Stem: 3539#ULTIMATE.startENTRY [99] 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] 3529#L-1 [127] L-1-->L7-4: 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|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 3530#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3563#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3550#L8 [2020-06-22 08:56:27,598 INFO L796 eck$LassoCheckResult]: Loop: 3550#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 3540#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3541#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3562#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3561#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 3555#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 3556#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3557#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3552#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3531#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 3532#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 3560#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3559#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3558#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3535#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 3536#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 3548#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3554#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3550#L8 [2020-06-22 08:56:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 3997744, now seen corresponding path program 1 times [2020-06-22 08:56:27,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:27,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:27,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:27,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:27,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1083134898, now seen corresponding path program 2 times [2020-06-22 08:56:27,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:27,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:27,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1305757217, now seen corresponding path program 2 times [2020-06-22 08:56:27,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:27,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:27,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:27,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:27,994 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2020-06-22 08:56:28,238 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2020-06-22 08:56:28,314 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:28,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:28,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:28,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:28,314 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:28,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:28,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:28,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:28,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso [2020-06-22 08:56:28,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:28,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:28,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:28,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 08:56:28,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:28,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 08:56:28,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:56:28,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 08:56:28,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 08:56:28,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 08:56:28,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 08:56:28,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 08:56:28,532 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2020-06-22 08:56:28,643 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-06-22 08:56:28,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:28,954 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:28,954 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 08:56:28,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,956 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 08:56:28,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,958 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 08:56:28,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,960 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 08:56:28,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:28,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:28,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,962 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 08:56:28,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,964 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 08:56:28,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:28,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:28,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,966 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 08:56:28,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,968 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 08:56:28,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,969 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 08:56:28,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,971 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 08:56:28,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:28,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:28,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,973 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 08:56:28,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:28,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:28,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:28,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,976 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 08:56:28,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:28,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:28,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,987 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 08:56:28,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:28,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:28,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,992 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 08:56:28,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:28,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:28,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,994 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 08:56:28,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:28,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:28,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:28,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:28,999 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 08:56:28,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:28,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:28,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:28,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:29,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:29,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:29,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:29,003 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 08:56:29,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:29,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:29,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:29,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:29,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:29,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:29,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:29,007 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 08:56:29,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:29,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:29,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:29,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:29,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:29,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:29,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:29,011 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 08:56:29,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:29,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:29,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:29,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:29,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:29,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:29,026 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:29,032 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:56:29,032 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 08:56:29,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:29,033 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:56:29,034 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:29,034 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_10) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_10 + 3 Supporting invariants [] [2020-06-22 08:56:29,120 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:56:29,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:29,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:29,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:29,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 08:56:29,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:29,205 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:29,206 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 23 treesize of output 46 [2020-06-22 08:56:29,207 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:29,233 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2020-06-22 08:56:29,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:29,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 [2020-06-22 08:56:29,672 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-06-22 08:56:29,684 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 41 treesize of output 29 [2020-06-22 08:56:29,684 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:29,709 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:29,709 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 39 treesize of output 68 [2020-06-22 08:56:29,711 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:29,775 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size [2020-06-22 08:56:29,776 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:29,777 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 [2020-06-22 08:56:30,223 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-06-22 08:56:31,033 WARN L188 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2020-06-22 08:56:31,067 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:31,067 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 39 treesize of output 68 [2020-06-22 08:56:31,070 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:31,076 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 41 treesize of output 29 [2020-06-22 08:56:31,076 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:31,144 INFO L497 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size [2020-06-22 08:56:31,146 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:31,146 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:69 [2020-06-22 08:56:31,688 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-06-22 08:56:32,886 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2020-06-22 08:56:33,327 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-06-22 08:56:33,466 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 56 treesize of output 39 [2020-06-22 08:56:33,467 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:33,473 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:33,473 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 1 case distinctions, treesize of input 56 treesize of output 39 [2020-06-22 08:56:33,474 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:33,499 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:33,500 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:33,500 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:113, output treesize:75 [2020-06-22 08:56:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:35,381 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_45 Int)) (and (or (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_45) (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset))) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45))))) is different from true [2020-06-22 08:56:35,742 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (<= 3 (+ (* 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset)) c_oldRank0))) is different from true [2020-06-22 08:56:36,304 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((v_arrayElimCell_48 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (or (= 0 v_arrayElimCell_48) (not .cse0)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_48))) (or .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_48)))))) is different from true [2020-06-22 08:56:37,132 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (or (= v_arrayElimCell_49 v_arrayElimCell_50) (not .cse0)) (or (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_50) .cse0) (<= v_arrayElimCell_49 1) (<= (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~j~0.offset) (+ v_arrayElimCell_49 1)) (<= 3 (+ (* 2 v_arrayElimCell_50) c_oldRank0))))) (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45))))) is different from true [2020-06-22 08:56:38,322 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (<= .cse0 2) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base))))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse1 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (<= .cse1 2) (not (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))))) is different from true [2020-06-22 08:56:39,415 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (<= .cse0 2) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base))))) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse1 (select (select |c_#memory_int| v_prenex_7) v_prenex_8))) (and (not (= v_prenex_8 c_ULTIMATE.start_main_~i~0.offset)) (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (<= .cse1 2))))) is different from true [2020-06-22 08:56:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,535 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,551 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,570 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,592 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,613 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,634 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,655 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,671 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,688 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,706 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:39,722 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:39,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 08:56:39,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:39,755 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:39,756 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 23 treesize of output 46 [2020-06-22 08:56:39,757 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:39,779 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2020-06-22 08:56:39,780 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:39,780 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 [2020-06-22 08:56:39,850 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:39,851 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 39 treesize of output 68 [2020-06-22 08:56:39,853 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2020-06-22 08:56:39,858 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:39,923 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size [2020-06-22 08:56:39,924 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:39,924 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 [2020-06-22 08:56:40,022 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:40,022 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 39 treesize of output 68 [2020-06-22 08:56:40,025 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:40,031 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 41 treesize of output 29 [2020-06-22 08:56:40,031 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:40,098 INFO L497 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size [2020-06-22 08:56:40,100 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:40,101 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:69 [2020-06-22 08:56:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:40,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:56:40,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:40,450 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:40,450 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 23 treesize of output 46 [2020-06-22 08:56:40,451 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:40,474 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2020-06-22 08:56:40,474 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:40,475 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 [2020-06-22 08:56:40,546 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:40,546 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 39 treesize of output 68 [2020-06-22 08:56:40,548 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:40,553 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 41 treesize of output 29 [2020-06-22 08:56:40,553 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:40,619 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size [2020-06-22 08:56:40,621 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:40,621 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 [2020-06-22 08:56:40,699 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 41 treesize of output 29 [2020-06-22 08:56:40,699 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:40,732 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:40,732 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 39 treesize of output 68 [2020-06-22 08:56:40,736 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:40,823 INFO L497 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size [2020-06-22 08:56:40,825 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:40,826 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:69 [2020-06-22 08:56:40,967 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:40,967 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 1 case distinctions, treesize of input 53 treesize of output 36 [2020-06-22 08:56:40,968 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:40,992 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:40,996 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 53 treesize of output 36 [2020-06-22 08:56:40,997 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:41,015 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:41,016 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-06-22 08:56:41,016 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:107, output treesize:69 [2020-06-22 08:56:46,514 INFO L98 LoopCannibalizer]: 23 predicates before loop cannibalization 26 predicates after loop cannibalization [2020-06-22 08:56:46,515 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 26 loop predicates [2020-06-22 08:56:46,515 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 60 states and 77 transitions. cyclomatic complexity: 20 Second operand 12 states. [2020-06-22 08:56:51,003 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2020-06-22 08:56:54,431 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2020-06-22 08:57:00,909 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2020-06-22 08:57:03,906 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-06-22 08:57:11,061 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2020-06-22 08:57:13,559 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-06-22 08:57:15,094 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 60 states and 77 transitions. cyclomatic complexity: 20. Second operand 12 states. Result 261 states and 309 transitions. Complement of second has 68 states. [2020-06-22 08:57:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 1 stem states 28 non-accepting loop states 3 accepting loop states [2020-06-22 08:57:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 08:57:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2020-06-22 08:57:15,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 64 transitions. Stem has 4 letters. Loop has 18 letters. [2020-06-22 08:57:15,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:57:15,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 64 transitions. Stem has 22 letters. Loop has 18 letters. [2020-06-22 08:57:15,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:57:15,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 64 transitions. Stem has 4 letters. Loop has 36 letters. [2020-06-22 08:57:15,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:57:15,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 309 transitions. [2020-06-22 08:57:15,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 08:57:15,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 181 states and 212 transitions. [2020-06-22 08:57:15,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-06-22 08:57:15,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-06-22 08:57:15,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 212 transitions. [2020-06-22 08:57:15,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:57:15,107 INFO L706 BuchiCegarLoop]: Abstraction has 181 states and 212 transitions. [2020-06-22 08:57:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 212 transitions. [2020-06-22 08:57:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 114. [2020-06-22 08:57:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-06-22 08:57:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2020-06-22 08:57:15,112 INFO L729 BuchiCegarLoop]: Abstraction has 114 states and 141 transitions. [2020-06-22 08:57:15,112 INFO L609 BuchiCegarLoop]: Abstraction has 114 states and 141 transitions. [2020-06-22 08:57:15,112 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 08:57:15,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 141 transitions. [2020-06-22 08:57:15,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 08:57:15,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:57:15,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:57:15,114 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 08:57:15,114 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2020-06-22 08:57:15,114 INFO L794 eck$LassoCheckResult]: Stem: 4306#ULTIMATE.startENTRY [99] 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] 4296#L-1 [127] L-1-->L7-4: 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|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 4297#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4354#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4355#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 4318#L9-3 [2020-06-22 08:57:15,115 INFO L796 eck$LassoCheckResult]: Loop: 4318#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4337#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4333#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4334#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4328#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4307#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4308#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4327#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4298#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4299#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4336#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4335#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4321#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4322#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4332#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4331#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4330#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4329#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4302#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 4303#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 4315#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4325#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4317#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 4318#L9-3 [2020-06-22 08:57:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:57:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash 123930156, now seen corresponding path program 1 times [2020-06-22 08:57:15,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:57:15,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:57:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:57:15,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:57:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:57:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:57:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 21197804, now seen corresponding path program 3 times [2020-06-22 08:57:15,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:57:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:57:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:57:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:57:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:57:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:57:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1206080159, now seen corresponding path program 3 times [2020-06-22 08:57:15,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:57:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:57:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:57:15,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:57:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:57:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:15,573 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2020-06-22 08:57:15,854 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-06-22 08:57:15,958 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-06-22 08:57:15,962 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:57:15,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:57:15,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:57:15,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:57:15,963 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:57:15,963 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:57:15,963 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:57:15,963 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:57:15,963 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso [2020-06-22 08:57:15,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:57:15,963 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:57:15,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 08:57:15,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:15,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:15,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:15,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:15,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:15,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:15,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:16,178 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-06-22 08:57:16,290 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-06-22 08:57:16,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:16,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:16,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:16,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:57:16,649 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:57:16,649 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:57:16,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:57:16,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:57:16,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:57:16,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:57:16,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,652 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 08:57:16,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:57:16,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:57:16,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:57:16,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:57:16,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:57:16,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:57:16,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:57:16,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:57:16,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:57:16,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:57:16,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:57:16,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:57:16,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:57:16,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:57:16,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:57:16,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,667 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 08:57:16,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,671 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 08:57:16,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,681 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 08:57:16,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,686 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 08:57:16,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,691 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 08:57:16,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,695 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 08:57:16,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,699 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 08:57:16,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:57:16,703 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 08:57:16,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:57:16,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:57:16,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:57:16,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:57:16,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:57:16,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:57:16,711 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:57:16,716 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:57:16,716 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:57:16,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:57:16,717 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:57:16,717 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:57:16,717 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_11, v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_11) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_11 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_11 Supporting invariants [] [2020-06-22 08:57:16,825 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 08:57:16,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:57:16,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:57:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:57:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:16,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:57:16,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:16,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 08:57:16,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:16,926 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:16,926 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 3 case distinctions, treesize of input 27 treesize of output 93 [2020-06-22 08:57:16,939 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,015 INFO L497 ElimStorePlain]: treesize reduction 48, result has 59.7 percent of original size [2020-06-22 08:57:17,015 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 08:57:17,015 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:61 [2020-06-22 08:57:17,103 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 24 treesize of output 20 [2020-06-22 08:57:17,103 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,158 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:17,159 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 3 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:17,160 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,208 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:17,209 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:17,210 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,265 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:17,266 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 3 case distinctions, treesize of input 28 treesize of output 94 [2020-06-22 08:57:17,267 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:17,273 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 24 treesize of output 1 [2020-06-22 08:57:17,274 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2020-06-22 08:57:17,280 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:17,285 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 24 treesize of output 1 [2020-06-22 08:57:17,285 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,377 INFO L497 ElimStorePlain]: treesize reduction 143, result has 43.3 percent of original size [2020-06-22 08:57:17,378 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 08:57:17,378 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:187, output treesize:82 [2020-06-22 08:57:17,566 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 42 treesize of output 33 [2020-06-22 08:57:17,566 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,627 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:17,627 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 4 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:17,664 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,771 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:17,771 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 112 [2020-06-22 08:57:17,783 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,791 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:17,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:17,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2020-06-22 08:57:17,794 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,858 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:17,858 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 5 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:17,891 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,900 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:17,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:17,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2020-06-22 08:57:17,905 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:17,917 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:17,918 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 1 case distinctions, treesize of input 42 treesize of output 33 [2020-06-22 08:57:17,918 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:18,190 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 38 [2020-06-22 08:57:18,190 INFO L497 ElimStorePlain]: treesize reduction 694, result has 12.8 percent of original size [2020-06-22 08:57:18,191 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-06-22 08:57:18,191 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:313, output treesize:91 [2020-06-22 08:57:18,544 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:18,545 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:18,571 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:18,604 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:18,605 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 53 treesize of output 74 [2020-06-22 08:57:18,606 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:18,724 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2020-06-22 08:57:18,724 INFO L497 ElimStorePlain]: treesize reduction 188, result has 36.3 percent of original size [2020-06-22 08:57:18,725 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 08:57:18,725 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 [2020-06-22 08:57:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:57:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:20,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 08:57:20,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:20,151 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:20,152 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 3 case distinctions, treesize of input 27 treesize of output 93 [2020-06-22 08:57:20,157 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,214 INFO L497 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size [2020-06-22 08:57:20,215 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 08:57:20,215 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:44 [2020-06-22 08:57:20,264 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 24 treesize of output 20 [2020-06-22 08:57:20,264 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,311 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:20,312 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 3 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:20,313 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:20,320 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 24 treesize of output 1 [2020-06-22 08:57:20,320 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,327 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 24 treesize of output 20 [2020-06-22 08:57:20,327 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,384 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:20,384 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 3 case distinctions, treesize of input 28 treesize of output 94 [2020-06-22 08:57:20,385 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,433 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:20,434 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:20,435 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:20,441 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 24 treesize of output 1 [2020-06-22 08:57:20,441 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,534 INFO L497 ElimStorePlain]: treesize reduction 163, result has 40.1 percent of original size [2020-06-22 08:57:20,535 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 08:57:20,535 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:187, output treesize:82 [2020-06-22 08:57:20,553 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:20,557 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2020-06-22 08:57:20,557 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,619 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:20,620 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 5 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:20,646 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,666 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:20,666 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 1 case distinctions, treesize of input 42 treesize of output 33 [2020-06-22 08:57:20,667 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,735 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:20,735 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 4 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:20,764 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,787 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 42 treesize of output 33 [2020-06-22 08:57:20,788 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,797 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:20,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:20,801 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2020-06-22 08:57:20,802 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:20,926 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:20,926 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 112 [2020-06-22 08:57:20,935 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:21,234 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 39 [2020-06-22 08:57:21,234 INFO L497 ElimStorePlain]: treesize reduction 766, result has 11.9 percent of original size [2020-06-22 08:57:21,235 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-06-22 08:57:21,235 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:313, output treesize:91 [2020-06-22 08:57:21,351 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:21,351 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:21,383 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:21,414 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:21,414 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 53 treesize of output 74 [2020-06-22 08:57:21,416 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:21,581 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2020-06-22 08:57:21,581 INFO L497 ElimStorePlain]: treesize reduction 214, result has 33.3 percent of original size [2020-06-22 08:57:21,582 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 08:57:21,582 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 [2020-06-22 08:57:21,630 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:21,631 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 4 case distinctions, treesize of input 55 treesize of output 89 [2020-06-22 08:57:21,636 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:21,672 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:21,672 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 55 treesize of output 89 [2020-06-22 08:57:21,679 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:21,771 INFO L497 ElimStorePlain]: treesize reduction 123, result has 45.1 percent of original size [2020-06-22 08:57:21,772 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-06-22 08:57:21,773 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:97 [2020-06-22 08:57:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:22,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 08:57:22,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:22,136 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:22,136 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 3 case distinctions, treesize of input 27 treesize of output 93 [2020-06-22 08:57:22,141 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,198 INFO L497 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size [2020-06-22 08:57:22,199 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 08:57:22,199 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:44 [2020-06-22 08:57:22,249 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 24 treesize of output 20 [2020-06-22 08:57:22,250 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,299 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:22,299 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 3 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:22,301 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,308 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 24 treesize of output 20 [2020-06-22 08:57:22,308 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,358 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:22,358 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:22,360 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,367 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 24 treesize of output 1 [2020-06-22 08:57:22,367 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,375 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 24 treesize of output 1 [2020-06-22 08:57:22,375 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,429 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:22,429 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 3 case distinctions, treesize of input 28 treesize of output 94 [2020-06-22 08:57:22,430 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,533 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-06-22 08:57:22,534 INFO L497 ElimStorePlain]: treesize reduction 163, result has 40.1 percent of original size [2020-06-22 08:57:22,534 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 08:57:22,534 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:187, output treesize:82 [2020-06-22 08:57:22,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,733 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:22,733 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 5 case distinctions, treesize of input 43 treesize of output 109 [2020-06-22 08:57:22,737 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,743 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:22,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,745 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2020-06-22 08:57:22,745 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,804 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:22,804 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 4 case distinctions, treesize of input 46 treesize of output 112 [2020-06-22 08:57:22,815 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,828 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 39 treesize of output 30 [2020-06-22 08:57:22,828 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,836 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:22,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,839 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2020-06-22 08:57:22,839 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:22,901 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:22,902 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 5 case distinctions, treesize of input 46 treesize of output 112 [2020-06-22 08:57:22,913 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:22,923 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:22,923 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 1 case distinctions, treesize of input 39 treesize of output 30 [2020-06-22 08:57:22,924 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:23,082 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 33 [2020-06-22 08:57:23,082 INFO L497 ElimStorePlain]: treesize reduction 731, result has 11.8 percent of original size [2020-06-22 08:57:23,083 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-06-22 08:57:23,083 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 1 variables, input treesize:292, output treesize:98 [2020-06-22 08:57:23,134 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:23,135 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 53 treesize of output 74 [2020-06-22 08:57:23,136 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:23,229 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:23,229 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:23,249 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:23,403 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2020-06-22 08:57:23,403 INFO L497 ElimStorePlain]: treesize reduction 192, result has 35.6 percent of original size [2020-06-22 08:57:23,404 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 08:57:23,404 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 [2020-06-22 08:57:23,450 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:23,450 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 4 case distinctions, treesize of input 55 treesize of output 89 [2020-06-22 08:57:23,455 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:23,490 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:23,490 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 55 treesize of output 89 [2020-06-22 08:57:23,496 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:23,572 INFO L497 ElimStorePlain]: treesize reduction 136, result has 42.6 percent of original size [2020-06-22 08:57:23,573 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-06-22 08:57:23,573 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:97 [2020-06-22 08:57:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:23,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 08:57:23,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:24,014 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:24,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 108 [2020-06-22 08:57:24,037 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:24,187 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2020-06-22 08:57:24,188 INFO L497 ElimStorePlain]: treesize reduction 166, result has 31.4 percent of original size [2020-06-22 08:57:24,188 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 08:57:24,188 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:71 [2020-06-22 08:57:24,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:24,705 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:24,706 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 67 [2020-06-22 08:57:24,707 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:24,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:24,759 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:24,759 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 46 treesize of output 86 [2020-06-22 08:57:24,762 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:24,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:24,808 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:24,808 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 4 case distinctions, treesize of input 46 treesize of output 86 [2020-06-22 08:57:24,811 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:24,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:24,908 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:24,909 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 5 case distinctions, treesize of input 44 treesize of output 110 [2020-06-22 08:57:24,911 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:24,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:24,922 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 39 treesize of output 30 [2020-06-22 08:57:24,923 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:24,929 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:24,929 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 1 case distinctions, treesize of input 39 treesize of output 30 [2020-06-22 08:57:24,930 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:25,150 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2020-06-22 08:57:25,150 INFO L497 ElimStorePlain]: treesize reduction 424, result has 28.5 percent of original size [2020-06-22 08:57:25,151 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-06-22 08:57:25,151 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:253, output treesize:165 [2020-06-22 08:57:25,327 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-06-22 08:57:25,628 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:25,629 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 53 treesize of output 74 [2020-06-22 08:57:25,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:25,721 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:25,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:25,737 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:25,909 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2020-06-22 08:57:25,909 INFO L497 ElimStorePlain]: treesize reduction 184, result has 35.0 percent of original size [2020-06-22 08:57:25,910 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 08:57:25,910 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:85 [2020-06-22 08:57:25,991 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:25,991 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 4 case distinctions, treesize of input 55 treesize of output 89 [2020-06-22 08:57:25,997 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:26,037 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:26,038 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 55 treesize of output 89 [2020-06-22 08:57:26,043 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:26,135 INFO L497 ElimStorePlain]: treesize reduction 151, result has 40.1 percent of original size [2020-06-22 08:57:26,135 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:57:26,136 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 [2020-06-22 08:57:26,962 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:27,498 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:27,500 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:27,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 08:57:27,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:27,721 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:27,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 108 [2020-06-22 08:57:27,737 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:27,865 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2020-06-22 08:57:27,865 INFO L497 ElimStorePlain]: treesize reduction 176, result has 28.2 percent of original size [2020-06-22 08:57:27,866 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 08:57:27,866 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:64 [2020-06-22 08:57:27,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:27,972 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:27,972 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 46 treesize of output 86 [2020-06-22 08:57:27,975 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:27,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:28,005 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:28,006 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 67 [2020-06-22 08:57:28,007 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:28,108 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:28,109 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 5 case distinctions, treesize of input 44 treesize of output 110 [2020-06-22 08:57:28,111 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:28,122 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 39 treesize of output 30 [2020-06-22 08:57:28,123 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:28,171 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:28,171 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 4 case distinctions, treesize of input 46 treesize of output 86 [2020-06-22 08:57:28,174 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,184 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:28,185 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 1 case distinctions, treesize of input 39 treesize of output 30 [2020-06-22 08:57:28,185 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,491 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 39 [2020-06-22 08:57:28,491 INFO L497 ElimStorePlain]: treesize reduction 442, result has 25.5 percent of original size [2020-06-22 08:57:28,491 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-06-22 08:57:28,492 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:253, output treesize:149 [2020-06-22 08:57:28,639 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:28,639 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:28,657 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,688 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:28,688 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 53 treesize of output 74 [2020-06-22 08:57:28,690 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,814 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2020-06-22 08:57:28,814 INFO L497 ElimStorePlain]: treesize reduction 186, result has 34.7 percent of original size [2020-06-22 08:57:28,815 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 08:57:28,815 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:85 [2020-06-22 08:57:28,894 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:28,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 4 case distinctions, treesize of input 55 treesize of output 89 [2020-06-22 08:57:28,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:28,940 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:28,940 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 55 treesize of output 89 [2020-06-22 08:57:28,945 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:29,056 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2020-06-22 08:57:29,056 INFO L497 ElimStorePlain]: treesize reduction 151, result has 40.1 percent of original size [2020-06-22 08:57:29,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:57:29,057 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 [2020-06-22 08:57:29,321 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:29,322 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 1 case distinctions, treesize of input 57 treesize of output 59 [2020-06-22 08:57:29,322 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:29,350 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:29,351 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 57 treesize of output 59 [2020-06-22 08:57:29,351 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:29,378 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:29,379 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 57 treesize of output 59 [2020-06-22 08:57:29,379 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:29,397 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:29,398 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 57 treesize of output 59 [2020-06-22 08:57:29,398 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:29,508 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-06-22 08:57:29,508 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size [2020-06-22 08:57:29,509 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:57:29,509 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:29 [2020-06-22 08:57:29,581 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:29,582 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:29,583 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:29,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 08:57:29,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:29,696 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:29,696 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 108 [2020-06-22 08:57:29,713 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:29,840 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2020-06-22 08:57:29,840 INFO L497 ElimStorePlain]: treesize reduction 152, result has 30.9 percent of original size [2020-06-22 08:57:29,841 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 08:57:29,841 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:64 [2020-06-22 08:57:29,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:30,003 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:30,003 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 5 case distinctions, treesize of input 44 treesize of output 110 [2020-06-22 08:57:30,006 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:30,017 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:30,017 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 39 treesize of output 30 [2020-06-22 08:57:30,017 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:30,026 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 39 treesize of output 30 [2020-06-22 08:57:30,027 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:30,071 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:30,072 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 4 case distinctions, treesize of input 46 treesize of output 86 [2020-06-22 08:57:30,074 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:30,107 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:30,108 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 67 [2020-06-22 08:57:30,109 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,147 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:30,147 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 46 treesize of output 86 [2020-06-22 08:57:30,150 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,415 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2020-06-22 08:57:30,415 INFO L497 ElimStorePlain]: treesize reduction 387, result has 35.5 percent of original size [2020-06-22 08:57:30,415 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-06-22 08:57:30,416 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:253, output treesize:211 [2020-06-22 08:57:30,555 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:30,555 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 53 treesize of output 74 [2020-06-22 08:57:30,556 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,654 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:30,654 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:30,674 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,810 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2020-06-22 08:57:30,811 INFO L497 ElimStorePlain]: treesize reduction 200, result has 34.9 percent of original size [2020-06-22 08:57:30,811 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 08:57:30,811 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 [2020-06-22 08:57:30,861 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:30,862 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 4 case distinctions, treesize of input 55 treesize of output 89 [2020-06-22 08:57:30,867 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:30,906 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:30,906 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 55 treesize of output 89 [2020-06-22 08:57:30,911 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,002 INFO L497 ElimStorePlain]: treesize reduction 151, result has 40.1 percent of original size [2020-06-22 08:57:31,003 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:57:31,003 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 [2020-06-22 08:57:31,245 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,245 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 57 treesize of output 59 [2020-06-22 08:57:31,246 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,269 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,270 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 1 case distinctions, treesize of input 57 treesize of output 59 [2020-06-22 08:57:31,270 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,295 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,295 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 57 treesize of output 59 [2020-06-22 08:57:31,296 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,311 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,312 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 57 treesize of output 59 [2020-06-22 08:57:31,312 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,411 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size [2020-06-22 08:57:31,412 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,412 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:29 [2020-06-22 08:57:31,418 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:31,419 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:31,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:31,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 08:57:31,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:31,502 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,503 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 3 case distinctions, treesize of input 27 treesize of output 93 [2020-06-22 08:57:31,506 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,567 INFO L497 ElimStorePlain]: treesize reduction 51, result has 55.3 percent of original size [2020-06-22 08:57:31,568 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 08:57:31,568 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:53 [2020-06-22 08:57:31,585 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:31,589 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2020-06-22 08:57:31,589 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,650 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,651 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 4 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:31,669 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,677 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:31,681 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2020-06-22 08:57:31,682 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,744 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,745 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 5 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:31,761 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,876 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:31,876 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 112 [2020-06-22 08:57:31,885 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,904 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:31,904 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 1 case distinctions, treesize of input 42 treesize of output 33 [2020-06-22 08:57:31,905 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:31,915 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 42 treesize of output 33 [2020-06-22 08:57:31,915 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,182 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 37 [2020-06-22 08:57:32,182 INFO L497 ElimStorePlain]: treesize reduction 738, result has 14.7 percent of original size [2020-06-22 08:57:32,194 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-06-22 08:57:32,195 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:313, output treesize:98 [2020-06-22 08:57:32,316 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:32,316 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:32,333 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,361 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:32,361 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 53 treesize of output 74 [2020-06-22 08:57:32,363 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,476 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2020-06-22 08:57:32,476 INFO L497 ElimStorePlain]: treesize reduction 187, result has 36.4 percent of original size [2020-06-22 08:57:32,477 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 08:57:32,477 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 [2020-06-22 08:57:32,523 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:32,524 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 4 case distinctions, treesize of input 55 treesize of output 89 [2020-06-22 08:57:32,529 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,565 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:32,565 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 55 treesize of output 89 [2020-06-22 08:57:32,570 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,637 INFO L497 ElimStorePlain]: treesize reduction 158, result has 39.0 percent of original size [2020-06-22 08:57:32,638 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:57:32,639 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 [2020-06-22 08:57:32,878 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:32,878 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 1 case distinctions, treesize of input 57 treesize of output 59 [2020-06-22 08:57:32,879 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,904 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:32,904 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 57 treesize of output 59 [2020-06-22 08:57:32,905 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,930 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:32,931 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 57 treesize of output 59 [2020-06-22 08:57:32,931 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:32,946 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:32,947 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 57 treesize of output 59 [2020-06-22 08:57:32,947 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:33,057 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-06-22 08:57:33,057 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size [2020-06-22 08:57:33,058 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:57:33,058 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:29 [2020-06-22 08:57:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:33,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 08:57:33,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:33,411 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:33,412 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 [2020-06-22 08:57:33,426 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:33,571 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2020-06-22 08:57:33,571 INFO L497 ElimStorePlain]: treesize reduction 177, result has 30.9 percent of original size [2020-06-22 08:57:33,572 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 08:57:33,572 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:85 [2020-06-22 08:57:34,110 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:34,110 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 67 treesize of output 80 [2020-06-22 08:57:34,113 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:34,201 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:34,202 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:34,225 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:34,346 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-06-22 08:57:34,346 INFO L497 ElimStorePlain]: treesize reduction 193, result has 36.3 percent of original size [2020-06-22 08:57:34,347 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 08:57:34,347 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:94 [2020-06-22 08:57:34,624 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:34,625 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 55 treesize of output 89 [2020-06-22 08:57:34,630 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:34,665 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:34,665 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 4 case distinctions, treesize of input 55 treesize of output 89 [2020-06-22 08:57:34,669 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:34,772 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-06-22 08:57:34,772 INFO L497 ElimStorePlain]: treesize reduction 138, result has 42.3 percent of original size [2020-06-22 08:57:34,773 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:57:34,773 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 [2020-06-22 08:57:35,014 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:35,015 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 57 treesize of output 59 [2020-06-22 08:57:35,015 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:35,041 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:35,042 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 57 treesize of output 59 [2020-06-22 08:57:35,042 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:35,069 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:35,070 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 57 treesize of output 59 [2020-06-22 08:57:35,070 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:35,084 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:35,085 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 1 case distinctions, treesize of input 57 treesize of output 59 [2020-06-22 08:57:35,085 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:35,185 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size [2020-06-22 08:57:35,186 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-06-22 08:57:35,186 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:229, output treesize:149 [2020-06-22 08:57:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:35,793 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:57:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:35,818 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:57:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:35,840 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:57:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:35,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 08:57:35,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:36,214 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:36,214 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 113 [2020-06-22 08:57:36,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:36,313 INFO L497 ElimStorePlain]: treesize reduction 157, result has 29.3 percent of original size [2020-06-22 08:57:36,314 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 08:57:36,314 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:58 [2020-06-22 08:57:36,645 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:36,646 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 59 treesize of output 93 [2020-06-22 08:57:36,650 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:36,685 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:36,686 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 4 case distinctions, treesize of input 59 treesize of output 93 [2020-06-22 08:57:36,691 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:36,791 INFO L497 ElimStorePlain]: treesize reduction 159, result has 39.8 percent of original size [2020-06-22 08:57:36,791 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:57:36,791 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:119, output treesize:105 [2020-06-22 08:57:36,907 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 34 treesize of output 26 [2020-06-22 08:57:36,907 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:36,954 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:36,954 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 4 case distinctions, treesize of input 53 treesize of output 93 [2020-06-22 08:57:36,957 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:36,966 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 34 treesize of output 26 [2020-06-22 08:57:36,966 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:37,002 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:37,002 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 53 treesize of output 93 [2020-06-22 08:57:37,005 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:37,126 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2020-06-22 08:57:37,126 INFO L497 ElimStorePlain]: treesize reduction 219, result has 37.8 percent of original size [2020-06-22 08:57:37,127 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-06-22 08:57:37,127 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:175, output treesize:95 [2020-06-22 08:57:37,256 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 27 treesize of output 23 [2020-06-22 08:57:37,256 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:37,291 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:37,292 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 78 [2020-06-22 08:57:37,293 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:37,331 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:37,331 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 78 [2020-06-22 08:57:37,333 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:37,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:37,338 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2020-06-22 08:57:37,338 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:37,405 INFO L497 ElimStorePlain]: treesize reduction 75, result has 59.2 percent of original size [2020-06-22 08:57:37,406 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 08:57:37,406 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:147, output treesize:91 [2020-06-22 08:57:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:38,931 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:57:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:38,955 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:57:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:38,982 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:57:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:39,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 08:57:39,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:39,218 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:39,218 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 3 case distinctions, treesize of input 38 treesize of output 92 [2020-06-22 08:57:39,222 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:39,286 INFO L497 ElimStorePlain]: treesize reduction 32, result has 69.8 percent of original size [2020-06-22 08:57:39,287 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:57:39,287 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:74 [2020-06-22 08:57:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2020-06-22 08:57:39,812 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:39,819 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 34 treesize of output 26 [2020-06-22 08:57:39,819 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:39,879 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:39,879 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 5 case distinctions, treesize of input 51 treesize of output 117 [2020-06-22 08:57:39,889 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:39,956 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:39,956 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 4 case distinctions, treesize of input 51 treesize of output 117 [2020-06-22 08:57:39,965 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:39,976 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 34 treesize of output 26 [2020-06-22 08:57:39,977 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:39,984 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2020-06-22 08:57:39,984 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:40,235 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 41 [2020-06-22 08:57:40,235 INFO L497 ElimStorePlain]: treesize reduction 422, result has 19.8 percent of original size [2020-06-22 08:57:40,236 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 08:57:40,236 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:239, output treesize:76 [2020-06-22 08:57:40,790 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 27 treesize of output 23 [2020-06-22 08:57:40,791 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:40,838 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:40,838 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 76 [2020-06-22 08:57:40,840 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:40,846 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 27 treesize of output 23 [2020-06-22 08:57:40,846 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:40,852 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 27 treesize of output 23 [2020-06-22 08:57:40,853 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:40,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:40,859 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2020-06-22 08:57:40,859 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:40,889 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:40,890 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 76 [2020-06-22 08:57:40,891 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:41,086 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-06-22 08:57:41,086 INFO L497 ElimStorePlain]: treesize reduction 115, result has 53.3 percent of original size [2020-06-22 08:57:41,087 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-06-22 08:57:41,087 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:197, output treesize:84 [2020-06-22 08:57:41,798 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:41,799 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 62 treesize of output 94 [2020-06-22 08:57:41,804 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:41,817 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 45 treesize of output 36 [2020-06-22 08:57:41,818 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:41,823 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:41,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2020-06-22 08:57:41,827 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:41,872 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:41,873 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 4 case distinctions, treesize of input 62 treesize of output 94 [2020-06-22 08:57:41,877 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:41,890 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:41,891 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 1 case distinctions, treesize of input 45 treesize of output 36 [2020-06-22 08:57:41,891 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:41,897 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2020-06-22 08:57:41,897 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:42,061 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2020-06-22 08:57:42,062 INFO L497 ElimStorePlain]: treesize reduction 277, result has 35.3 percent of original size [2020-06-22 08:57:42,063 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-06-22 08:57:42,063 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:305, output treesize:123 [2020-06-22 08:57:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:57:45,660 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:57:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:57:45,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 08:57:45,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:57:45,717 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:45,718 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 3 case distinctions, treesize of input 25 treesize of output 87 [2020-06-22 08:57:45,721 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:45,787 INFO L497 ElimStorePlain]: treesize reduction 44, result has 61.1 percent of original size [2020-06-22 08:57:45,787 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:57:45,787 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:69 [2020-06-22 08:57:46,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2020-06-22 08:57:46,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:46,440 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 31 treesize of output 23 [2020-06-22 08:57:46,440 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:46,447 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 31 treesize of output 23 [2020-06-22 08:57:46,447 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:46,546 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:46,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 109 [2020-06-22 08:57:46,548 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:46,557 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 31 treesize of output 23 [2020-06-22 08:57:46,557 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:46,617 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:46,618 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 5 case distinctions, treesize of input 38 treesize of output 112 [2020-06-22 08:57:46,623 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:46,675 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:46,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 112 [2020-06-22 08:57:46,682 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:46,964 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2020-06-22 08:57:46,964 INFO L497 ElimStorePlain]: treesize reduction 509, result has 17.0 percent of original size [2020-06-22 08:57:46,965 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-06-22 08:57:46,965 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:236, output treesize:58 [2020-06-22 08:57:47,060 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:47,061 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 3 case distinctions, treesize of input 28 treesize of output 94 [2020-06-22 08:57:47,061 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,068 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 24 treesize of output 20 [2020-06-22 08:57:47,068 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,114 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:47,114 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:47,116 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:47,122 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 24 treesize of output 1 [2020-06-22 08:57:47,122 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:47,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 24 treesize of output 1 [2020-06-22 08:57:47,129 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,173 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:47,174 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 3 case distinctions, treesize of input 31 treesize of output 85 [2020-06-22 08:57:47,175 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:47,180 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 24 treesize of output 1 [2020-06-22 08:57:47,180 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,273 INFO L497 ElimStorePlain]: treesize reduction 143, result has 43.3 percent of original size [2020-06-22 08:57:47,274 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 08:57:47,274 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:187, output treesize:82 [2020-06-22 08:57:47,299 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:47,299 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 1 case distinctions, treesize of input 42 treesize of output 33 [2020-06-22 08:57:47,300 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,311 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 42 treesize of output 33 [2020-06-22 08:57:47,311 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,371 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:47,371 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 4 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:47,391 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,399 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:47,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:57:47,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2020-06-22 08:57:47,404 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,515 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:47,515 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 112 [2020-06-22 08:57:47,525 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,532 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 08:57:47,536 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2020-06-22 08:57:47,537 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,591 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:47,592 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 5 case distinctions, treesize of input 49 treesize of output 115 [2020-06-22 08:57:47,615 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:47,806 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 37 [2020-06-22 08:57:47,807 INFO L497 ElimStorePlain]: treesize reduction 723, result has 14.9 percent of original size [2020-06-22 08:57:47,807 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-06-22 08:57:47,808 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:313, output treesize:98 [2020-06-22 08:57:48,544 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:57:48,544 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 47 treesize of output 68 [2020-06-22 08:57:48,546 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:48,634 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 08:57:48,635 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 08:57:48,653 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:57:48,761 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2020-06-22 08:57:48,762 INFO L497 ElimStorePlain]: treesize reduction 199, result has 31.8 percent of original size [2020-06-22 08:57:48,762 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 08:57:48,763 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:79 [2020-06-22 08:57:49,550 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-06-22 08:57:51,658 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 08:57:53,087 INFO L98 LoopCannibalizer]: 42 predicates before loop cannibalization 122 predicates after loop cannibalization [2020-06-22 08:57:53,087 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 122 loop predicates [2020-06-22 08:57:53,088 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 114 states and 141 transitions. cyclomatic complexity: 32 Second operand 16 states. [2020-06-22 08:57:53,830 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 22 [2020-06-22 08:57:54,470 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 25 [2020-06-22 08:57:54,911 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 20 [2020-06-22 08:57:55,662 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 22 [2020-06-22 08:57:56,138 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 22 [2020-06-22 08:57:56,657 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 24 [2020-06-22 08:57:57,234 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 41 [2020-06-22 08:57:57,998 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 38 [2020-06-22 08:57:58,633 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2020-06-22 08:57:59,313 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 40 [2020-06-22 08:57:59,980 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2020-06-22 08:58:01,784 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 40 [2020-06-22 08:58:03,202 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2020-06-22 08:58:04,007 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 30 [2020-06-22 08:58:15,623 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 33 [2020-06-22 08:58:16,498 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 44 [2020-06-22 08:58:17,434 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 28 [2020-06-22 08:58:18,210 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 23 [2020-06-22 08:58:19,852 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 47 [2020-06-22 08:58:20,781 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 30 [2020-06-22 08:58:21,613 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 25 [2020-06-22 08:58:22,501 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 32 [2020-06-22 08:58:23,222 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 38 [2020-06-22 08:58:24,025 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 31 [2020-06-22 08:58:25,732 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 35 [2020-06-22 08:58:26,330 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 41 [2020-06-22 08:58:27,151 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 36 [2020-06-22 08:58:27,796 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 31 [2020-06-22 08:58:28,764 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 38 [2020-06-22 08:58:30,955 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 39 [2020-06-22 08:58:32,426 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 27 [2020-06-22 08:58:33,306 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 28 [2020-06-22 08:58:34,153 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 28 [2020-06-22 08:58:34,999 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 30 [2020-06-22 08:58:35,942 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 30 [2020-06-22 08:58:36,354 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-06-22 08:58:38,853 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 35 [2020-06-22 08:58:39,625 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 36 [2020-06-22 08:58:39,776 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 114 states and 141 transitions. cyclomatic complexity: 32. Second operand 16 states. Result 993 states and 1134 transitions. Complement of second has 236 states. [2020-06-22 08:58:39,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 55 states 1 stem states 48 non-accepting loop states 6 accepting loop states [2020-06-22 08:58:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 08:58:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2020-06-22 08:58:39,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 84 transitions. Stem has 5 letters. Loop has 23 letters. [2020-06-22 08:58:39,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:39,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 84 transitions. Stem has 28 letters. Loop has 23 letters. [2020-06-22 08:58:39,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:39,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 84 transitions. Stem has 5 letters. Loop has 46 letters. [2020-06-22 08:58:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:39,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 993 states and 1134 transitions. [2020-06-22 08:58:39,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 08:58:39,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 993 states to 381 states and 445 transitions. [2020-06-22 08:58:39,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-06-22 08:58:39,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-06-22 08:58:39,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 381 states and 445 transitions. [2020-06-22 08:58:39,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:58:39,799 INFO L706 BuchiCegarLoop]: Abstraction has 381 states and 445 transitions. [2020-06-22 08:58:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states and 445 transitions. [2020-06-22 08:58:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 208. [2020-06-22 08:58:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-06-22 08:58:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. [2020-06-22 08:58:39,806 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 256 transitions. [2020-06-22 08:58:39,806 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 256 transitions. [2020-06-22 08:58:39,806 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 08:58:39,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 256 transitions. [2020-06-22 08:58:39,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 08:58:39,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:58:39,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:58:39,808 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:58:39,808 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 08:58:39,809 INFO L794 eck$LassoCheckResult]: Stem: 6809#ULTIMATE.startENTRY [99] 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] 6801#L-1 [127] L-1-->L7-4: 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|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 6802#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 6824#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 6890#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 6889#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6811#L9 [2020-06-22 08:58:39,809 INFO L796 eck$LassoCheckResult]: Loop: 6811#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 6818#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 6803#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 6804#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 6810#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6811#L9 [2020-06-22 08:58:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -453132391, now seen corresponding path program 1 times [2020-06-22 08:58:39,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:58:39,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:58:39,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:39,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:58:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:39,821 INFO L82 PathProgramCache]: Analyzing trace with hash 99224683, now seen corresponding path program 1 times [2020-06-22 08:58:39,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:58:39,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:58:39,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:39,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:58:39,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1475589165, now seen corresponding path program 1 times [2020-06-22 08:58:39,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:58:39,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:58:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:39,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:58:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:40,119 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2020-06-22 08:58:40,194 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:58:40,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:58:40,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:58:40,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:58:40,195 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:58:40,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:58:40,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:58:40,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:58:40,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso [2020-06-22 08:58:40,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:58:40,195 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:58:40,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,403 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2020-06-22 08:58:40,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:40,802 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:58:40,803 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:58:40,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 08:58:40,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:40,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:40,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:40,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:40,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:40,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:40,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:40,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:58:40,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:40,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:40,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:40,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:40,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:40,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:40,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:40,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 08:58:40,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:40,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:58:40,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:40,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:40,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:40,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:58:40,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:58:40,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:40,817 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 08:58:40,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:40,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:40,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:40,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:40,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:40,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:40,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:40,819 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 08:58:40,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:40,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:40,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:40,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:40,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:40,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:40,826 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:58:40,831 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:58:40,831 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:58:40,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:58:40,832 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 08:58:40,832 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:58:40,832 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_12, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_12) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_12 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_12 + 1 Supporting invariants [1*ULTIMATE.start_main_#t~mem5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_12 >= 0] [2020-06-22 08:58:40,888 INFO L297 tatePredicateManager]: 18 out of 21 supporting invariants were superfluous and have been removed [2020-06-22 08:58:40,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:58:40,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:58:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:58:40,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 08:58:40,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:58:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:58:40,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:58:40,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:58:41,055 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 51 treesize of output 34 [2020-06-22 08:58:41,187 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:58:41,199 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:58:41,199 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:58:41,199 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:39 [2020-06-22 08:58:41,225 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 08:58:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:41,390 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:58:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:41,396 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:58:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:41,402 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:58:41,402 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 08:58:41,403 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 8 loop predicates [2020-06-22 08:58:41,403 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 208 states and 256 transitions. cyclomatic complexity: 56 Second operand 7 states. [2020-06-22 08:58:42,255 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 208 states and 256 transitions. cyclomatic complexity: 56. Second operand 7 states. Result 2781 states and 3216 transitions. Complement of second has 148 states. [2020-06-22 08:58:42,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 5 stem states 20 non-accepting loop states 3 accepting loop states [2020-06-22 08:58:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 08:58:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 97 transitions. [2020-06-22 08:58:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 97 transitions. Stem has 6 letters. Loop has 5 letters. [2020-06-22 08:58:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 97 transitions. Stem has 11 letters. Loop has 5 letters. [2020-06-22 08:58:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 97 transitions. Stem has 6 letters. Loop has 10 letters. [2020-06-22 08:58:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:42,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2781 states and 3216 transitions. [2020-06-22 08:58:42,283 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 30 [2020-06-22 08:58:42,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2781 states to 707 states and 844 transitions. [2020-06-22 08:58:42,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-06-22 08:58:42,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-06-22 08:58:42,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 707 states and 844 transitions. [2020-06-22 08:58:42,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:58:42,289 INFO L706 BuchiCegarLoop]: Abstraction has 707 states and 844 transitions. [2020-06-22 08:58:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states and 844 transitions. [2020-06-22 08:58:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 208. [2020-06-22 08:58:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-06-22 08:58:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 254 transitions. [2020-06-22 08:58:42,297 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 254 transitions. [2020-06-22 08:58:42,297 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 254 transitions. [2020-06-22 08:58:42,297 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 08:58:42,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 254 transitions. [2020-06-22 08:58:42,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 08:58:42,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:58:42,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:58:42,299 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:58:42,299 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 08:58:42,300 INFO L794 eck$LassoCheckResult]: Stem: 10146#ULTIMATE.startENTRY [99] 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] 10138#L-1 [126] L-1-->L7-4: 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|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.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_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |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_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_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|) (= 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_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_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_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_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_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 10139#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 10161#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 10165#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 10195#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 10151#L9 [2020-06-22 08:58:42,300 INFO L796 eck$LassoCheckResult]: Loop: 10151#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 10158#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 10140#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 10141#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 10150#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 10151#L9 [2020-06-22 08:58:42,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:42,300 INFO L82 PathProgramCache]: Analyzing trace with hash -454055912, now seen corresponding path program 1 times [2020-06-22 08:58:42,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:58:42,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:58:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:58:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:42,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 99224683, now seen corresponding path program 2 times [2020-06-22 08:58:42,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:58:42,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:58:42,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:42,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:58:42,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1279075660, now seen corresponding path program 1 times [2020-06-22 08:58:42,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:58:42,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:58:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:42,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:58:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:58:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:42,660 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2020-06-22 08:58:42,782 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-06-22 08:58:42,785 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:58:42,785 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:58:42,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:58:42,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:58:42,786 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:58:42,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:58:42,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:58:42,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:58:42,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso [2020-06-22 08:58:42,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:58:42,786 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:58:42,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:42,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:42,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:42,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:42,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:43,040 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-06-22 08:58:43,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:43,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:43,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:43,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:58:43,414 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:58:43,415 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:58:43,415 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 08:58:43,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:58:43,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:58:43,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:58:43,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:58:43,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,419 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 08:58:43,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:58:43,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:58:43,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:58:43,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:58:43,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:58:43,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:58:43,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:58:43,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,422 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 08:58:43,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,424 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 08:58:43,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,428 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 08:58:43,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,431 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 08:58:43,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,434 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 08:58:43,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,437 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 08:58:43,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:58:43,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:58:43,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:58:43,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,439 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 08:58:43,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,443 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 08:58:43,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:58:43,446 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 08:58:43,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:58:43,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:58:43,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:58:43,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:58:43,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:58:43,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:58:43,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:58:43,456 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:58:43,457 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:58:43,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:58:43,458 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 08:58:43,458 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:58:43,458 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_13, v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_13) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_13 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_13 + 1 Supporting invariants [1*ULTIMATE.start_main_#t~mem5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_13 >= 0] [2020-06-22 08:58:43,518 INFO L297 tatePredicateManager]: 18 out of 21 supporting invariants were superfluous and have been removed [2020-06-22 08:58:43,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:58:43,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:58:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:58:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:58:43,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 08:58:43,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:58:43,578 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 08:58:43,578 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:58:43,583 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:58:43,584 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:58:43,584 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-06-22 08:58:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:58:43,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:58:43,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:58:43,673 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 51 treesize of output 34 [2020-06-22 08:58:43,674 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:58:43,688 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:58:43,689 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:58:43,689 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:39 [2020-06-22 08:58:43,716 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 08:58:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:43,848 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:58:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:43,855 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:58:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:58:43,861 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:58:43,861 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 08:58:43,861 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 8 loop predicates [2020-06-22 08:58:43,861 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 208 states and 254 transitions. cyclomatic complexity: 54 Second operand 7 states. [2020-06-22 08:58:44,162 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 208 states and 254 transitions. cyclomatic complexity: 54. Second operand 7 states. Result 666 states and 778 transitions. Complement of second has 40 states. [2020-06-22 08:58:44,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 2 accepting loop states [2020-06-22 08:58:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 08:58:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2020-06-22 08:58:44,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 6 letters. Loop has 5 letters. [2020-06-22 08:58:44,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:44,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 11 letters. Loop has 5 letters. [2020-06-22 08:58:44,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:44,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 6 letters. Loop has 10 letters. [2020-06-22 08:58:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:58:44,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 778 transitions. [2020-06-22 08:58:44,185 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:58:44,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 0 states and 0 transitions. [2020-06-22 08:58:44,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:58:44,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:58:44,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:58:44,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:58:44,186 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:58:44,186 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:58:44,186 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:58:44,186 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 08:58:44,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:58:44,186 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:58:44,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:58:44,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:58:44 BasicIcfg [2020-06-22 08:58:44,194 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:58:44,194 INFO L168 Benchmark]: Toolchain (without parser) took 181453.35 ms. Allocated memory was 649.6 MB in the beginning and 638.1 MB in the end (delta: -11.5 MB). Free memory was 559.2 MB in the beginning and 559.7 MB in the end (delta: -575.8 kB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:58:44,195 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:58:44,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.87 ms. Allocated memory was 649.6 MB in the beginning and 687.3 MB in the end (delta: 37.7 MB). Free memory was 557.8 MB in the beginning and 653.6 MB in the end (delta: -95.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-06-22 08:58:44,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 687.3 MB. Free memory was 653.6 MB in the beginning and 650.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:58:44,195 INFO L168 Benchmark]: Boogie Preprocessor took 22.83 ms. Allocated memory is still 687.3 MB. Free memory was 650.5 MB in the beginning and 649.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:58:44,195 INFO L168 Benchmark]: RCFGBuilder took 307.33 ms. Allocated memory is still 687.3 MB. Free memory was 649.1 MB in the beginning and 625.7 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:58:44,196 INFO L168 Benchmark]: BlockEncodingV2 took 136.28 ms. Allocated memory is still 687.3 MB. Free memory was 625.7 MB in the beginning and 616.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:58:44,196 INFO L168 Benchmark]: TraceAbstraction took 1276.00 ms. Allocated memory is still 687.3 MB. Free memory was 616.3 MB in the beginning and 493.9 MB in the end (delta: 122.4 MB). Peak memory consumption was 122.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:58:44,196 INFO L168 Benchmark]: BuchiAutomizer took 179375.49 ms. Allocated memory was 687.3 MB in the beginning and 638.1 MB in the end (delta: -49.3 MB). Free memory was 493.9 MB in the beginning and 559.7 MB in the end (delta: -65.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:58:44,197 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 37 locations, 40 edges - StatisticsResult: Encoded RCFG 30 locations, 56 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 291.87 ms. Allocated memory was 649.6 MB in the beginning and 687.3 MB in the end (delta: 37.7 MB). Free memory was 557.8 MB in the beginning and 653.6 MB in the end (delta: -95.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 687.3 MB. Free memory was 653.6 MB in the beginning and 650.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.83 ms. Allocated memory is still 687.3 MB. Free memory was 650.5 MB in the beginning and 649.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 307.33 ms. Allocated memory is still 687.3 MB. Free memory was 649.1 MB in the beginning and 625.7 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 136.28 ms. Allocated memory is still 687.3 MB. Free memory was 625.7 MB in the beginning and 616.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1276.00 ms. Allocated memory is still 687.3 MB. Free memory was 616.3 MB in the beginning and 493.9 MB in the end (delta: 122.4 MB). Peak memory consumption was 122.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 179375.49 ms. Allocated memory was 687.3 MB in the beginning and 638.1 MB in the end (delta: -49.3 MB). Free memory was 493.9 MB in the beginning and 559.7 MB in the end (delta: -65.9 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-06-22 08:58:44,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == n && unknown-#length-unknown[n] == 4) && 0 == j) && \valid[n] == 1) && 4 == unknown-#length-unknown[i]) && 1 == \valid[j]) && 0 == i) && 1 == \valid[i]) && unknown-#length-unknown[j] == 4 - InvariantResult [Line: 7]: Loop Invariant [2020-06-22 08:58:44,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:58:44,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == n && unknown-#length-unknown[n] == 4) && 0 == j) && \valid[n] == 1) && 4 == unknown-#length-unknown[i]) && 1 == \valid[j]) && 0 == i) && 1 == \valid[i]) && unknown-#length-unknown[j] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 18 error locations. SAFE Result, 1.1s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 169 SDslu, 3 SDs, 0 SdLazy, 201 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 80 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 13 terminating modules (0 trivial, 0 deterministic, 13 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 1 and consists of 20 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 3 and consists of 32 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[n][n] and consists of 55 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 2 * unknown-#memory_int-unknown[i][i] + 1 and consists of 28 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[i][i] + -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 179.3s and 14 iterations. TraceHistogramMax:4. Analysis of lassos took 16.0s. Construction of modules took 17.4s. Büchi inclusion checks took 145.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1143 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 208 states and ocurred in iteration 11. Nontrivial modules had stage [13, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/38 HoareTripleCheckerStatistics: 141 SDtfs, 2027 SDslu, 182 SDs, 0 SdLazy, 5555 SolverSat, 1408 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 17.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso13 LassoPreprocessingBenchmarks: Lassos: inital240 mio100 ax100 hnf100 lsp97 ukn69 mio100 lsp42 div100 bol100 ite100 ukn100 eq193 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:55:39.412 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:58:44.432 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check