75.77/38.66 YES 75.77/38.66 75.77/38.66 Ultimate: Cannot open display: 75.77/38.66 This is Ultimate 0.1.24-8dc7c08-m 75.77/38.66 [2019-03-28 12:35:00,368 INFO L170 SettingsManager]: Resetting all preferences to default values... 75.77/38.66 [2019-03-28 12:35:00,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 75.77/38.66 [2019-03-28 12:35:00,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 75.77/38.66 [2019-03-28 12:35:00,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 75.77/38.66 [2019-03-28 12:35:00,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 75.77/38.66 [2019-03-28 12:35:00,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 75.77/38.66 [2019-03-28 12:35:00,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 75.77/38.66 [2019-03-28 12:35:00,388 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 75.77/38.66 [2019-03-28 12:35:00,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 75.77/38.66 [2019-03-28 12:35:00,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 75.77/38.66 [2019-03-28 12:35:00,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 75.77/38.66 [2019-03-28 12:35:00,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 75.77/38.66 [2019-03-28 12:35:00,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 75.77/38.66 [2019-03-28 12:35:00,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 75.77/38.66 [2019-03-28 12:35:00,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 75.77/38.66 [2019-03-28 12:35:00,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 75.77/38.66 [2019-03-28 12:35:00,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 75.77/38.66 [2019-03-28 12:35:00,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 75.77/38.66 [2019-03-28 12:35:00,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 75.77/38.66 [2019-03-28 12:35:00,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 75.77/38.66 [2019-03-28 12:35:00,404 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 75.77/38.66 [2019-03-28 12:35:00,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 75.77/38.66 [2019-03-28 12:35:00,405 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 75.77/38.66 [2019-03-28 12:35:00,406 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 75.77/38.66 [2019-03-28 12:35:00,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 75.77/38.66 [2019-03-28 12:35:00,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 75.77/38.66 [2019-03-28 12:35:00,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 75.77/38.66 [2019-03-28 12:35:00,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 75.77/38.66 [2019-03-28 12:35:00,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 75.77/38.66 [2019-03-28 12:35:00,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 75.77/38.66 [2019-03-28 12:35:00,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 75.77/38.66 [2019-03-28 12:35:00,412 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 75.77/38.66 [2019-03-28 12:35:00,427 INFO L110 SettingsManager]: Loading preferences was successful 75.77/38.66 [2019-03-28 12:35:00,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 75.77/38.66 [2019-03-28 12:35:00,428 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 75.77/38.66 [2019-03-28 12:35:00,428 INFO L133 SettingsManager]: * Rewrite not-equals=true 75.77/38.66 [2019-03-28 12:35:00,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 75.77/38.66 [2019-03-28 12:35:00,429 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 75.77/38.66 [2019-03-28 12:35:00,429 INFO L133 SettingsManager]: * Use SBE=true 75.77/38.66 [2019-03-28 12:35:00,429 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 75.77/38.66 [2019-03-28 12:35:00,429 INFO L133 SettingsManager]: * Use old map elimination=false 75.77/38.66 [2019-03-28 12:35:00,429 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 75.77/38.66 [2019-03-28 12:35:00,430 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 75.77/38.66 [2019-03-28 12:35:00,430 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 75.77/38.66 [2019-03-28 12:35:00,430 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 75.77/38.66 [2019-03-28 12:35:00,430 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 75.77/38.66 [2019-03-28 12:35:00,430 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 75.77/38.66 [2019-03-28 12:35:00,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 75.77/38.66 [2019-03-28 12:35:00,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 75.77/38.66 [2019-03-28 12:35:00,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE 75.77/38.66 [2019-03-28 12:35:00,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 75.77/38.66 [2019-03-28 12:35:00,431 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 75.77/38.66 [2019-03-28 12:35:00,432 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 75.77/38.66 [2019-03-28 12:35:00,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 75.77/38.66 [2019-03-28 12:35:00,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 75.77/38.66 [2019-03-28 12:35:00,432 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 75.77/38.66 [2019-03-28 12:35:00,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 75.77/38.66 [2019-03-28 12:35:00,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 75.77/38.66 [2019-03-28 12:35:00,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 75.77/38.66 [2019-03-28 12:35:00,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 75.77/38.66 [2019-03-28 12:35:00,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 75.77/38.66 [2019-03-28 12:35:00,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 75.77/38.66 [2019-03-28 12:35:00,472 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 75.77/38.66 [2019-03-28 12:35:00,476 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 75.77/38.66 [2019-03-28 12:35:00,477 INFO L271 PluginConnector]: Initializing CDTParser... 75.77/38.66 [2019-03-28 12:35:00,477 INFO L276 PluginConnector]: CDTParser initialized 75.77/38.66 [2019-03-28 12:35:00,478 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 75.77/38.66 [2019-03-28 12:35:00,547 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ab0f54fe79214e3bb838a4b350d05e8b/FLAG6bb110ae1 75.77/38.66 [2019-03-28 12:35:00,892 INFO L307 CDTParser]: Found 1 translation units. 75.77/38.66 [2019-03-28 12:35:00,893 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 75.77/38.66 [2019-03-28 12:35:00,893 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 75.77/38.66 [2019-03-28 12:35:00,900 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ab0f54fe79214e3bb838a4b350d05e8b/FLAG6bb110ae1 75.77/38.66 [2019-03-28 12:35:01,284 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ab0f54fe79214e3bb838a4b350d05e8b 75.77/38.66 [2019-03-28 12:35:01,295 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 75.77/38.66 [2019-03-28 12:35:01,297 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 75.77/38.66 [2019-03-28 12:35:01,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 75.77/38.66 [2019-03-28 12:35:01,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 75.77/38.66 [2019-03-28 12:35:01,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 75.77/38.66 [2019-03-28 12:35:01,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a48b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:01,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 75.77/38.66 [2019-03-28 12:35:01,332 INFO L176 MainTranslator]: Built tables and reachable declarations 75.77/38.66 [2019-03-28 12:35:01,497 INFO L206 PostProcessor]: Analyzing one entry point: main 75.77/38.66 [2019-03-28 12:35:01,510 INFO L191 MainTranslator]: Completed pre-run 75.77/38.66 [2019-03-28 12:35:01,592 INFO L206 PostProcessor]: Analyzing one entry point: main 75.77/38.66 [2019-03-28 12:35:01,609 INFO L195 MainTranslator]: Completed translation 75.77/38.66 [2019-03-28 12:35:01,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01 WrapperNode 75.77/38.66 [2019-03-28 12:35:01,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 75.77/38.66 [2019-03-28 12:35:01,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 75.77/38.66 [2019-03-28 12:35:01,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 75.77/38.66 [2019-03-28 12:35:01,611 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 75.77/38.66 [2019-03-28 12:35:01,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 75.77/38.66 [2019-03-28 12:35:01,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 75.77/38.66 [2019-03-28 12:35:01,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 75.77/38.66 [2019-03-28 12:35:01,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized 75.77/38.66 [2019-03-28 12:35:01,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 [2019-03-28 12:35:01,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 75.77/38.66 [2019-03-28 12:35:01,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 75.77/38.66 [2019-03-28 12:35:01,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... 75.77/38.66 [2019-03-28 12:35:01,682 INFO L276 PluginConnector]: RCFGBuilder initialized 75.77/38.66 [2019-03-28 12:35:01,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 75.77/38.66 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 75.77/38.66 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 75.77/38.66 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 75.77/38.66 [2019-03-28 12:35:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 75.77/38.66 [2019-03-28 12:35:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 75.77/38.66 [2019-03-28 12:35:01,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 75.77/38.66 [2019-03-28 12:35:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 75.77/38.66 [2019-03-28 12:35:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 75.77/38.66 [2019-03-28 12:35:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 75.77/38.66 [2019-03-28 12:35:02,103 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 75.77/38.66 [2019-03-28 12:35:02,104 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 75.77/38.66 [2019-03-28 12:35:02,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02 BoogieIcfgContainer 75.77/38.66 [2019-03-28 12:35:02,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 75.77/38.66 [2019-03-28 12:35:02,106 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 75.77/38.66 [2019-03-28 12:35:02,106 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 75.77/38.66 [2019-03-28 12:35:02,109 INFO L276 PluginConnector]: BlockEncodingV2 initialized 75.77/38.66 [2019-03-28 12:35:02,109 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02" (1/1) ... 75.77/38.66 [2019-03-28 12:35:02,130 INFO L313 BlockEncoder]: Initial Icfg 77 locations, 81 edges 75.77/38.66 [2019-03-28 12:35:02,131 INFO L258 BlockEncoder]: Using Remove infeasible edges 75.77/38.66 [2019-03-28 12:35:02,132 INFO L263 BlockEncoder]: Using Maximize final states 75.77/38.66 [2019-03-28 12:35:02,133 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 75.77/38.66 [2019-03-28 12:35:02,133 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 75.77/38.66 [2019-03-28 12:35:02,135 INFO L296 BlockEncoder]: Using Remove sink states 75.77/38.66 [2019-03-28 12:35:02,136 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 75.77/38.66 [2019-03-28 12:35:02,136 INFO L179 BlockEncoder]: Using Rewrite not-equals 75.77/38.66 [2019-03-28 12:35:02,167 INFO L185 BlockEncoder]: Using Use SBE 75.77/38.66 [2019-03-28 12:35:02,209 INFO L200 BlockEncoder]: SBE split 41 edges 75.77/38.66 [2019-03-28 12:35:02,214 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 75.77/38.66 [2019-03-28 12:35:02,218 INFO L71 MaximizeFinalStates]: 0 new accepting states 75.77/38.66 [2019-03-28 12:35:02,255 INFO L100 BaseMinimizeStates]: Removed 24 edges and 12 locations by large block encoding 75.77/38.66 [2019-03-28 12:35:02,258 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 75.77/38.66 [2019-03-28 12:35:02,261 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 75.77/38.66 [2019-03-28 12:35:02,261 INFO L71 MaximizeFinalStates]: 0 new accepting states 75.77/38.66 [2019-03-28 12:35:02,262 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 75.77/38.66 [2019-03-28 12:35:02,262 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 75.77/38.66 [2019-03-28 12:35:02,263 INFO L313 BlockEncoder]: Encoded RCFG 64 locations, 114 edges 75.77/38.66 [2019-03-28 12:35:02,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:02 BasicIcfg 75.77/38.66 [2019-03-28 12:35:02,264 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 75.77/38.66 [2019-03-28 12:35:02,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 75.77/38.66 [2019-03-28 12:35:02,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... 75.77/38.66 [2019-03-28 12:35:02,268 INFO L276 PluginConnector]: TraceAbstraction initialized 75.77/38.66 [2019-03-28 12:35:02,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:35:01" (1/4) ... 75.77/38.66 [2019-03-28 12:35:02,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb00abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:35:02, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:02,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (2/4) ... 75.77/38.66 [2019-03-28 12:35:02,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb00abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:35:02, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:02,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02" (3/4) ... 75.77/38.66 [2019-03-28 12:35:02,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb00abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:35:02, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:02,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:02" (4/4) ... 75.77/38.66 [2019-03-28 12:35:02,272 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 75.77/38.66 [2019-03-28 12:35:02,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 75.77/38.66 [2019-03-28 12:35:02,290 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. 75.77/38.66 [2019-03-28 12:35:02,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 36 error locations. 75.77/38.66 [2019-03-28 12:35:02,337 INFO L133 ementStrategyFactory]: Using default assertion order modulation 75.77/38.66 [2019-03-28 12:35:02,338 INFO L382 AbstractCegarLoop]: Interprodecural is true 75.77/38.66 [2019-03-28 12:35:02,338 INFO L383 AbstractCegarLoop]: Hoare is true 75.77/38.66 [2019-03-28 12:35:02,338 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 75.77/38.66 [2019-03-28 12:35:02,338 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 75.77/38.66 [2019-03-28 12:35:02,339 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 75.77/38.66 [2019-03-28 12:35:02,339 INFO L387 AbstractCegarLoop]: Difference is false 75.77/38.66 [2019-03-28 12:35:02,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 75.77/38.66 [2019-03-28 12:35:02,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 75.77/38.66 [2019-03-28 12:35:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. 75.77/38.66 [2019-03-28 12:35:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 75.77/38.66 [2019-03-28 12:35:02,361 INFO L394 BasicCegarLoop]: Found error trace 75.77/38.66 [2019-03-28 12:35:02,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 75.77/38.66 [2019-03-28 12:35:02,362 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 75.77/38.66 [2019-03-28 12:35:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash 176376, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:02,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:02,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:02,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:02,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.77/38.66 [2019-03-28 12:35:02,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.77/38.66 [2019-03-28 12:35:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:02,582 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:02,823 INFO L93 Difference]: Finished difference Result 64 states and 114 transitions. 75.77/38.66 [2019-03-28 12:35:02,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:02,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 75.77/38.66 [2019-03-28 12:35:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.77/38.66 [2019-03-28 12:35:02,839 INFO L225 Difference]: With dead ends: 64 75.77/38.66 [2019-03-28 12:35:02,839 INFO L226 Difference]: Without dead ends: 57 75.77/38.66 [2019-03-28 12:35:02,843 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 75.77/38.66 [2019-03-28 12:35:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. 75.77/38.66 [2019-03-28 12:35:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. 75.77/38.66 [2019-03-28 12:35:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 75.77/38.66 [2019-03-28 12:35:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 100 transitions. 75.77/38.66 [2019-03-28 12:35:02,886 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 100 transitions. Word has length 3 75.77/38.66 [2019-03-28 12:35:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. 75.77/38.66 [2019-03-28 12:35:02,887 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 100 transitions. 75.77/38.66 [2019-03-28 12:35:02,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 100 transitions. 75.77/38.66 [2019-03-28 12:35:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 75.77/38.66 [2019-03-28 12:35:02,888 INFO L394 BasicCegarLoop]: Found error trace 75.77/38.66 [2019-03-28 12:35:02,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 75.77/38.66 [2019-03-28 12:35:02,888 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 75.77/38.66 [2019-03-28 12:35:02,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 176378, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:02,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:02,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:02,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:02,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:02,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:02,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.77/38.66 [2019-03-28 12:35:02,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.77/38.66 [2019-03-28 12:35:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:02,932 INFO L87 Difference]: Start difference. First operand 57 states and 100 transitions. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:03,075 INFO L93 Difference]: Finished difference Result 57 states and 100 transitions. 75.77/38.66 [2019-03-28 12:35:03,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 75.77/38.66 [2019-03-28 12:35:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.77/38.66 [2019-03-28 12:35:03,077 INFO L225 Difference]: With dead ends: 57 75.77/38.66 [2019-03-28 12:35:03,077 INFO L226 Difference]: Without dead ends: 50 75.77/38.66 [2019-03-28 12:35:03,079 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 75.77/38.66 [2019-03-28 12:35:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. 75.77/38.66 [2019-03-28 12:35:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. 75.77/38.66 [2019-03-28 12:35:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. 75.77/38.66 [2019-03-28 12:35:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 86 transitions. 75.77/38.66 [2019-03-28 12:35:03,086 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 86 transitions. Word has length 3 75.77/38.66 [2019-03-28 12:35:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. 75.77/38.66 [2019-03-28 12:35:03,086 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 86 transitions. 75.77/38.66 [2019-03-28 12:35:03,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 86 transitions. 75.77/38.66 [2019-03-28 12:35:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 75.77/38.66 [2019-03-28 12:35:03,087 INFO L394 BasicCegarLoop]: Found error trace 75.77/38.66 [2019-03-28 12:35:03,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,087 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 75.77/38.66 [2019-03-28 12:35:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:03,088 INFO L82 PathProgramCache]: Analyzing trace with hash 5470376, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:03,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:03,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:03,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:03,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:03,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.77/38.66 [2019-03-28 12:35:03,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.77/38.66 [2019-03-28 12:35:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:03,153 INFO L87 Difference]: Start difference. First operand 50 states and 86 transitions. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:03,322 INFO L93 Difference]: Finished difference Result 50 states and 86 transitions. 75.77/38.66 [2019-03-28 12:35:03,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 75.77/38.66 [2019-03-28 12:35:03,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.77/38.66 [2019-03-28 12:35:03,324 INFO L225 Difference]: With dead ends: 50 75.77/38.66 [2019-03-28 12:35:03,324 INFO L226 Difference]: Without dead ends: 45 75.77/38.66 [2019-03-28 12:35:03,324 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 75.77/38.66 [2019-03-28 12:35:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 75.77/38.66 [2019-03-28 12:35:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 75.77/38.66 [2019-03-28 12:35:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 75.77/38.66 [2019-03-28 12:35:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. 75.77/38.66 [2019-03-28 12:35:03,330 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 4 75.77/38.66 [2019-03-28 12:35:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. 75.77/38.66 [2019-03-28 12:35:03,331 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 76 transitions. 75.77/38.66 [2019-03-28 12:35:03,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 76 transitions. 75.77/38.66 [2019-03-28 12:35:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 75.77/38.66 [2019-03-28 12:35:03,331 INFO L394 BasicCegarLoop]: Found error trace 75.77/38.66 [2019-03-28 12:35:03,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,332 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 75.77/38.66 [2019-03-28 12:35:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 5470374, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:03,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:03,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:03,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:03,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.77/38.66 [2019-03-28 12:35:03,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.77/38.66 [2019-03-28 12:35:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:03,370 INFO L87 Difference]: Start difference. First operand 45 states and 76 transitions. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:03,478 INFO L93 Difference]: Finished difference Result 45 states and 76 transitions. 75.77/38.66 [2019-03-28 12:35:03,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 75.77/38.66 [2019-03-28 12:35:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.77/38.66 [2019-03-28 12:35:03,479 INFO L225 Difference]: With dead ends: 45 75.77/38.66 [2019-03-28 12:35:03,479 INFO L226 Difference]: Without dead ends: 40 75.77/38.66 [2019-03-28 12:35:03,480 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 75.77/38.66 [2019-03-28 12:35:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 75.77/38.66 [2019-03-28 12:35:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 75.77/38.66 [2019-03-28 12:35:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 75.77/38.66 [2019-03-28 12:35:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. 75.77/38.66 [2019-03-28 12:35:03,485 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 4 75.77/38.66 [2019-03-28 12:35:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. 75.77/38.66 [2019-03-28 12:35:03,485 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. 75.77/38.66 [2019-03-28 12:35:03,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. 75.77/38.66 [2019-03-28 12:35:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 75.77/38.66 [2019-03-28 12:35:03,486 INFO L394 BasicCegarLoop]: Found error trace 75.77/38.66 [2019-03-28 12:35:03,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,486 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 75.77/38.66 [2019-03-28 12:35:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash 169584223, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:03,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:03,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:03,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:03,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.77/38.66 [2019-03-28 12:35:03,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.77/38.66 [2019-03-28 12:35:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:03,516 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:03,611 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. 75.77/38.66 [2019-03-28 12:35:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 75.77/38.66 [2019-03-28 12:35:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.77/38.66 [2019-03-28 12:35:03,612 INFO L225 Difference]: With dead ends: 40 75.77/38.66 [2019-03-28 12:35:03,613 INFO L226 Difference]: Without dead ends: 34 75.77/38.66 [2019-03-28 12:35:03,613 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 75.77/38.66 [2019-03-28 12:35:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 75.77/38.66 [2019-03-28 12:35:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 75.77/38.66 [2019-03-28 12:35:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 75.77/38.66 [2019-03-28 12:35:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. 75.77/38.66 [2019-03-28 12:35:03,617 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 5 75.77/38.66 [2019-03-28 12:35:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. 75.77/38.66 [2019-03-28 12:35:03,617 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. 75.77/38.66 [2019-03-28 12:35:03,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. 75.77/38.66 [2019-03-28 12:35:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 75.77/38.66 [2019-03-28 12:35:03,618 INFO L394 BasicCegarLoop]: Found error trace 75.77/38.66 [2019-03-28 12:35:03,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,619 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 75.77/38.66 [2019-03-28 12:35:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 169584225, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:03,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:03,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:03,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:03,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:03,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.77/38.66 [2019-03-28 12:35:03,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.77/38.66 [2019-03-28 12:35:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:03,646 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:03,708 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. 75.77/38.66 [2019-03-28 12:35:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 75.77/38.66 [2019-03-28 12:35:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.77/38.66 [2019-03-28 12:35:03,709 INFO L225 Difference]: With dead ends: 40 75.77/38.66 [2019-03-28 12:35:03,710 INFO L226 Difference]: Without dead ends: 34 75.77/38.66 [2019-03-28 12:35:03,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 75.77/38.66 [2019-03-28 12:35:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 75.77/38.66 [2019-03-28 12:35:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 75.77/38.66 [2019-03-28 12:35:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. 75.77/38.66 [2019-03-28 12:35:03,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 5 75.77/38.66 [2019-03-28 12:35:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. 75.77/38.66 [2019-03-28 12:35:03,715 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. 75.77/38.66 [2019-03-28 12:35:03,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. 75.77/38.66 [2019-03-28 12:35:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 75.77/38.66 [2019-03-28 12:35:03,715 INFO L394 BasicCegarLoop]: Found error trace 75.77/38.66 [2019-03-28 12:35:03,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,716 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 75.77/38.66 [2019-03-28 12:35:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash 169584226, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:03,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:03,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.77/38.66 [2019-03-28 12:35:03,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.77/38.66 [2019-03-28 12:35:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:03,751 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:03,813 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. 75.77/38.66 [2019-03-28 12:35:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 75.77/38.66 [2019-03-28 12:35:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.77/38.66 [2019-03-28 12:35:03,814 INFO L225 Difference]: With dead ends: 34 75.77/38.66 [2019-03-28 12:35:03,814 INFO L226 Difference]: Without dead ends: 0 75.77/38.66 [2019-03-28 12:35:03,815 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 75.77/38.66 [2019-03-28 12:35:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 75.77/38.66 [2019-03-28 12:35:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 75.77/38.66 [2019-03-28 12:35:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 75.77/38.66 [2019-03-28 12:35:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 75.77/38.66 [2019-03-28 12:35:03,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 75.77/38.66 [2019-03-28 12:35:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. 75.77/38.66 [2019-03-28 12:35:03,816 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 75.77/38.66 [2019-03-28 12:35:03,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 75.77/38.66 [2019-03-28 12:35:03,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 75.77/38.66 [2019-03-28 12:35:03,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 75.77/38.66 [2019-03-28 12:35:03,852 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,852 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,852 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,852 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,853 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,853 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,853 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,853 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,853 INFO L448 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point L23-6(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point L23-7(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point L23-8(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point L23-9(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point L23-11(lines 23 33) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,854 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 32) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,855 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,856 INFO L444 ceAbstractionStarter]: At program point L24-4(lines 23 33) the Hoare annotation is: (and (= ULTIMATE.start_main_~z~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~z~0.base) 4) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~z~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) 75.77/38.66 [2019-03-28 12:35:03,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,858 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,859 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 75.77/38.66 [2019-03-28 12:35:03,861 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 75.77/38.66 [2019-03-28 12:35:03,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.77/38.66 [2019-03-28 12:35:03,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.77/38.66 [2019-03-28 12:35:03,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.77/38.66 [2019-03-28 12:35:03,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.77/38.66 [2019-03-28 12:35:03,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.77/38.66 [2019-03-28 12:35:03,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.77/38.66 [2019-03-28 12:35:03,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:35:03 BasicIcfg 75.77/38.66 [2019-03-28 12:35:03,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 75.77/38.66 [2019-03-28 12:35:03,881 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 75.77/38.66 [2019-03-28 12:35:03,882 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 75.77/38.66 [2019-03-28 12:35:03,885 INFO L276 PluginConnector]: BuchiAutomizer initialized 75.77/38.66 [2019-03-28 12:35:03,886 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.77/38.66 [2019-03-28 12:35:03,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:35:01" (1/5) ... 75.77/38.66 [2019-03-28 12:35:03,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:35:03, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:03,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.77/38.66 [2019-03-28 12:35:03,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (2/5) ... 75.77/38.66 [2019-03-28 12:35:03,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:35:03, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:03,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.77/38.66 [2019-03-28 12:35:03,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02" (3/5) ... 75.77/38.66 [2019-03-28 12:35:03,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:35:03, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:03,888 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.77/38.66 [2019-03-28 12:35:03,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:02" (4/5) ... 75.77/38.66 [2019-03-28 12:35:03,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:35:03, skipping insertion in model container 75.77/38.66 [2019-03-28 12:35:03,888 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.77/38.66 [2019-03-28 12:35:03,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:35:03" (5/5) ... 75.77/38.66 [2019-03-28 12:35:03,890 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 75.77/38.66 [2019-03-28 12:35:03,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation 75.77/38.66 [2019-03-28 12:35:03,912 INFO L374 BuchiCegarLoop]: Interprodecural is true 75.77/38.66 [2019-03-28 12:35:03,913 INFO L375 BuchiCegarLoop]: Hoare is true 75.77/38.66 [2019-03-28 12:35:03,913 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 75.77/38.66 [2019-03-28 12:35:03,913 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 75.77/38.66 [2019-03-28 12:35:03,913 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 75.77/38.66 [2019-03-28 12:35:03,913 INFO L379 BuchiCegarLoop]: Difference is false 75.77/38.66 [2019-03-28 12:35:03,913 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 75.77/38.66 [2019-03-28 12:35:03,913 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 75.77/38.66 [2019-03-28 12:35:03,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. 75.77/38.66 [2019-03-28 12:35:03,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 75.77/38.66 [2019-03-28 12:35:03,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.77/38.66 [2019-03-28 12:35:03,925 INFO L119 BuchiIsEmpty]: Starting construction of run 75.77/38.66 [2019-03-28 12:35:03,929 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,929 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,930 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 75.77/38.66 [2019-03-28 12:35:03,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. 75.77/38.66 [2019-03-28 12:35:03,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 75.77/38.66 [2019-03-28 12:35:03,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.77/38.66 [2019-03-28 12:35:03,933 INFO L119 BuchiIsEmpty]: Starting construction of run 75.77/38.66 [2019-03-28 12:35:03,934 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,934 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:03,940 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [233] L-1-->L19: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 26#L19true [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 48#L20true [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 12#L21true [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 49#L24-4true 75.77/38.66 [2019-03-28 12:35:03,941 INFO L796 eck$LassoCheckResult]: Loop: 49#L24-4true [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 52#L23-1true [250] L23-1-->L23-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem6_3|) (not |v_ULTIMATE.start_main_#t~short8_2|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 50#L23-2true [169] L23-2-->L23-6: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 23#L23-6true [256] L23-6-->L23-7: Formula: (and (not |v_ULTIMATE.start_main_#t~short10_2|) (not |v_ULTIMATE.start_main_#t~short8_6|)) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 21#L23-7true [130] L23-7-->L23-11: Formula: (not |v_ULTIMATE.start_main_#t~short10_5|) InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_5|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_5|} AuxVars[] AssignedVars[] 35#L23-11true [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 64#L24true [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 61#L24-1true [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 59#L24-2true [177] L24-2-->L25: Formula: (< |v_ULTIMATE.start_main_#t~mem12_4| |v_ULTIMATE.start_main_#t~mem11_4|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_4|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_4|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 17#L25true [120] L25-->L25-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 15#L25-1true [320] L25-1-->L26: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_15) (<= (+ v_ULTIMATE.start_main_~y~0.offset_15 4) (select |v_#length_44| v_ULTIMATE.start_main_~y~0.base_20)) (= (store |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20 (store (select |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20) v_ULTIMATE.start_main_~y~0.offset_15 |v_ULTIMATE.start_main_#t~mem13_6|)) |v_#memory_int_34|) (= 1 (select |v_#valid_56| v_ULTIMATE.start_main_~y~0.base_20))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 20#L26true [322] L26-->L27: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 |v_ULTIMATE.start_main_#t~nondet14_5|))) (= (select |v_#valid_58| v_ULTIMATE.start_main_~x~0.base_26) 1)) InVars {ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_4|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14, #memory_int] 42#L27true [153] L27-->L27-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 40#L27-1true [324] L27-1-->L24-4: Formula: (and (= (select |v_#valid_60| v_ULTIMATE.start_main_~z~0.base_24) 1) (= (store |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24 (store (select |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24) v_ULTIMATE.start_main_~z~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem15_6| (- 1)))) |v_#memory_int_42|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_18) (<= (+ v_ULTIMATE.start_main_~z~0.offset_18 4) (select |v_#length_48| v_ULTIMATE.start_main_~z~0.base_24))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_43|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_42|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 49#L24-4true 75.77/38.66 [2019-03-28 12:35:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:03,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:03,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:03,993 INFO L82 PathProgramCache]: Analyzing trace with hash 262092399, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:03,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:03,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:04,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:04,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 75.77/38.66 [2019-03-28 12:35:04,006 INFO L811 eck$LassoCheckResult]: loop already infeasible 75.77/38.66 [2019-03-28 12:35:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:04,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:04,008 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:04,169 INFO L93 Difference]: Finished difference Result 66 states and 115 transitions. 75.77/38.66 [2019-03-28 12:35:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:04,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 115 transitions. 75.77/38.66 [2019-03-28 12:35:04,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 75.77/38.66 [2019-03-28 12:35:04,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 75.77/38.66 [2019-03-28 12:35:04,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 75.77/38.66 [2019-03-28 12:35:04,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.77/38.66 [2019-03-28 12:35:04,178 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 75.77/38.66 [2019-03-28 12:35:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 75.77/38.66 [2019-03-28 12:35:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,181 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,182 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,182 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 75.77/38.66 [2019-03-28 12:35:04,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. 75.77/38.66 [2019-03-28 12:35:04,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 75.77/38.66 [2019-03-28 12:35:04,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.77/38.66 [2019-03-28 12:35:04,183 INFO L119 BuchiIsEmpty]: Starting construction of run 75.77/38.66 [2019-03-28 12:35:04,183 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:04,183 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:04,184 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 149#L-1 [233] L-1-->L19: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 150#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 146#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 147#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 140#L24-4 75.77/38.66 [2019-03-28 12:35:04,185 INFO L796 eck$LassoCheckResult]: Loop: 140#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 148#L23-1 [250] L23-1-->L23-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem6_3|) (not |v_ULTIMATE.start_main_#t~short8_2|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 151#L23-2 [169] L23-2-->L23-6: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 153#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 159#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 157#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 158#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 164#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 165#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 166#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 163#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 144#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 142#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 143#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 161#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 145#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 140#L24-4 75.77/38.66 [2019-03-28 12:35:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:04,186 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 2 times 75.77/38.66 [2019-03-28 12:35:04,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:04,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1245620856, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:04,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:04,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.77/38.66 [2019-03-28 12:35:04,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 75.77/38.66 [2019-03-28 12:35:04,223 INFO L811 eck$LassoCheckResult]: loop already infeasible 75.77/38.66 [2019-03-28 12:35:04,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.77/38.66 [2019-03-28 12:35:04,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.77/38.66 [2019-03-28 12:35:04,224 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. 75.77/38.66 [2019-03-28 12:35:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.77/38.66 [2019-03-28 12:35:04,267 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. 75.77/38.66 [2019-03-28 12:35:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.77/38.66 [2019-03-28 12:35:04,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. 75.77/38.66 [2019-03-28 12:35:04,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 75.77/38.66 [2019-03-28 12:35:04,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 75.77/38.66 [2019-03-28 12:35:04,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 75.77/38.66 [2019-03-28 12:35:04,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.77/38.66 [2019-03-28 12:35:04,271 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 75.77/38.66 [2019-03-28 12:35:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 75.77/38.66 [2019-03-28 12:35:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,273 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,273 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,273 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 75.77/38.66 [2019-03-28 12:35:04,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. 75.77/38.66 [2019-03-28 12:35:04,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 75.77/38.66 [2019-03-28 12:35:04,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.77/38.66 [2019-03-28 12:35:04,274 INFO L119 BuchiIsEmpty]: Starting construction of run 75.77/38.66 [2019-03-28 12:35:04,275 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:04,275 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.77/38.66 [2019-03-28 12:35:04,275 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 213#L-1 [233] L-1-->L19: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 214#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 210#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 211#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 204#L24-4 75.77/38.66 [2019-03-28 12:35:04,276 INFO L796 eck$LassoCheckResult]: Loop: 204#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 212#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 215#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 216#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 224#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 223#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 222#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 220#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 221#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 228#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 229#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 230#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 227#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 208#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 206#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 207#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 225#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 209#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 204#L24-4 75.77/38.66 [2019-03-28 12:35:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 3 times 75.77/38.66 [2019-03-28 12:35:04,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:04,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash -979927020, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:04,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:04,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1077025003, now seen corresponding path program 1 times 75.77/38.66 [2019-03-28 12:35:04,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.66 [2019-03-28 12:35:04,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.66 [2019-03-28 12:35:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.66 [2019-03-28 12:35:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:04,622 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 75.77/38.66 [2019-03-28 12:35:04,961 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 75.77/38.66 [2019-03-28 12:35:05,071 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 74 75.77/38.66 [2019-03-28 12:35:05,086 INFO L216 LassoAnalysis]: Preferences: 75.77/38.66 [2019-03-28 12:35:05,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.77/38.66 [2019-03-28 12:35:05,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.77/38.66 [2019-03-28 12:35:05,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.77/38.66 [2019-03-28 12:35:05,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.77/38.66 [2019-03-28 12:35:05,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.77/38.66 [2019-03-28 12:35:05,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.77/38.66 [2019-03-28 12:35:05,088 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.77/38.66 [2019-03-28 12:35:05,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 75.77/38.66 [2019-03-28 12:35:05,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.77/38.66 [2019-03-28 12:35:05,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.77/38.66 [2019-03-28 12:35:05,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,435 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 75.77/38.66 [2019-03-28 12:35:05,555 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 75.77/38.66 [2019-03-28 12:35:05,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.66 [2019-03-28 12:35:05,969 INFO L300 LassoAnalysis]: Preprocessing complete. 75.77/38.66 [2019-03-28 12:35:05,975 INFO L497 LassoAnalysis]: Using template 'affine'. 75.77/38.66 [2019-03-28 12:35:05,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:05,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:05,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:05,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:05,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:05,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:05,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:05,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:05,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:05,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:05,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:05,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:05,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:05,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:05,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:05,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:05,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:05,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:05,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:05,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:05,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:05,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:05,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:05,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:05,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:05,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:05,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:05,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:05,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:05,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:05,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:05,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:05,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:05,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:05,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:05,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:05,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:05,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:05,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:05,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:05,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:05,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:05,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:05,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:05,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:05,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:05,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:05,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:05,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:05,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:06,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:06,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:06,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:06,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.66 [2019-03-28 12:35:06,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.66 [2019-03-28 12:35:06,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.66 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.66 Number of strict supporting invariants: 0 75.77/38.66 Number of non-strict supporting invariants: 1 75.77/38.66 Consider only non-deceasing supporting invariants: true 75.77/38.66 Simplify termination arguments: true 75.77/38.66 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.66 [2019-03-28 12:35:06,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.66 [2019-03-28 12:35:06,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.66 [2019-03-28 12:35:06,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.66 [2019-03-28 12:35:06,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.66 [2019-03-28 12:35:06,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.66 [2019-03-28 12:35:06,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.66 [2019-03-28 12:35:06,064 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.77/38.66 [2019-03-28 12:35:06,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 75.77/38.66 [2019-03-28 12:35:06,071 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 75.77/38.66 [2019-03-28 12:35:06,073 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.77/38.66 [2019-03-28 12:35:06,075 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 75.77/38.66 [2019-03-28 12:35:06,075 INFO L518 LassoAnalysis]: Proved termination. 75.77/38.66 [2019-03-28 12:35:06,076 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.77/38.66 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 75.77/38.66 Supporting invariants [] 75.77/38.66 [2019-03-28 12:35:06,155 INFO L297 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed 75.77/38.66 [2019-03-28 12:35:06,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.77/38.66 [2019-03-28 12:35:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.66 [2019-03-28 12:35:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:06,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:06,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:06,229 INFO L189 IndexEqualityManager]: detected not equals via solver 75.77/38.66 [2019-03-28 12:35:06,243 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 75.77/38.66 [2019-03-28 12:35:06,244 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,254 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,254 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 75.77/38.66 [2019-03-28 12:35:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:06,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:06,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:06,372 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.66 [2019-03-28 12:35:06,373 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,382 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,383 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,383 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.66 [2019-03-28 12:35:06,411 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:06,412 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,422 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,422 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,423 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 75.77/38.66 [2019-03-28 12:35:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.66 [2019-03-28 12:35:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:06,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:06,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:06,591 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.66 [2019-03-28 12:35:06,592 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,602 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,603 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,603 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.66 [2019-03-28 12:35:06,610 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:06,611 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,624 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,625 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,625 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 75.77/38.66 [2019-03-28 12:35:06,636 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.66 [2019-03-28 12:35:06,637 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,648 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,649 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,649 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 75.77/38.66 [2019-03-28 12:35:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:06,672 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.77/38.66 [2019-03-28 12:35:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:06,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:06,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:06,733 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 75.77/38.66 [2019-03-28 12:35:06,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,746 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,747 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,747 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 75.77/38.66 [2019-03-28 12:35:06,797 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:06,798 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,809 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,810 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,810 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 75.77/38.66 [2019-03-28 12:35:06,829 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.66 [2019-03-28 12:35:06,829 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,841 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,841 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,842 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 75.77/38.66 [2019-03-28 12:35:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:06,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:06,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:06,935 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 75.77/38.66 [2019-03-28 12:35:06,935 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,944 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,945 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,945 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 75.77/38.66 [2019-03-28 12:35:06,951 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:06,951 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,960 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,961 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,961 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 75.77/38.66 [2019-03-28 12:35:06,967 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.66 [2019-03-28 12:35:06,967 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,977 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:06,977 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:06,977 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 75.77/38.66 [2019-03-28 12:35:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.66 [2019-03-28 12:35:06,996 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.77/38.66 [2019-03-28 12:35:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:07,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:07,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:07,018 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 75.77/38.66 [2019-03-28 12:35:07,019 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,027 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:07,028 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,028 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 75.77/38.66 [2019-03-28 12:35:07,039 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:07,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,048 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:07,048 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,049 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 75.77/38.66 [2019-03-28 12:35:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:07,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:07,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:07,078 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:07,078 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,088 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:07,088 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,089 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 75.77/38.66 [2019-03-28 12:35:07,105 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.66 [2019-03-28 12:35:07,106 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,116 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:07,117 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,117 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.66 [2019-03-28 12:35:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.66 [2019-03-28 12:35:07,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.66 [2019-03-28 12:35:07,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.66 [2019-03-28 12:35:07,138 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:07,138 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,148 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:07,148 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,148 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 75.77/38.66 [2019-03-28 12:35:07,162 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.66 [2019-03-28 12:35:07,163 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,174 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:07,175 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,175 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.66 [2019-03-28 12:35:07,181 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.66 [2019-03-28 12:35:07,181 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,197 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.66 [2019-03-28 12:35:07,197 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.66 [2019-03-28 12:35:07,197 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 75.77/38.66 [2019-03-28 12:35:07,199 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization 75.77/38.67 [2019-03-28 12:35:07,203 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 9 loop predicates 75.77/38.67 [2019-03-28 12:35:07,204 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 9 Second operand 8 states. 75.77/38.67 [2019-03-28 12:35:08,559 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 494 states and 527 transitions. Complement of second has 119 states. 75.77/38.67 [2019-03-28 12:35:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 5 stem states 25 non-accepting loop states 2 accepting loop states 75.77/38.67 [2019-03-28 12:35:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 75.77/38.67 [2019-03-28 12:35:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 238 transitions. 75.77/38.67 [2019-03-28 12:35:08,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 238 transitions. Stem has 5 letters. Loop has 18 letters. 75.77/38.67 [2019-03-28 12:35:08,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.77/38.67 [2019-03-28 12:35:08,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 238 transitions. Stem has 23 letters. Loop has 18 letters. 75.77/38.67 [2019-03-28 12:35:08,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.77/38.67 [2019-03-28 12:35:08,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 238 transitions. Stem has 5 letters. Loop has 36 letters. 75.77/38.67 [2019-03-28 12:35:08,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.77/38.67 [2019-03-28 12:35:08,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 527 transitions. 75.77/38.67 [2019-03-28 12:35:08,587 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 161 75.77/38.67 [2019-03-28 12:35:08,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 311 states and 330 transitions. 75.77/38.67 [2019-03-28 12:35:08,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 75.77/38.67 [2019-03-28 12:35:08,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 75.77/38.67 [2019-03-28 12:35:08,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 330 transitions. 75.77/38.67 [2019-03-28 12:35:08,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 75.77/38.67 [2019-03-28 12:35:08,593 INFO L706 BuchiCegarLoop]: Abstraction has 311 states and 330 transitions. 75.77/38.67 [2019-03-28 12:35:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 330 transitions. 75.77/38.67 [2019-03-28 12:35:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 78. 75.77/38.67 [2019-03-28 12:35:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. 75.77/38.67 [2019-03-28 12:35:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. 75.77/38.67 [2019-03-28 12:35:08,601 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. 75.77/38.67 [2019-03-28 12:35:08,601 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. 75.77/38.67 [2019-03-28 12:35:08,601 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 75.77/38.67 [2019-03-28 12:35:08,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 89 transitions. 75.77/38.67 [2019-03-28 12:35:08,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 75.77/38.67 [2019-03-28 12:35:08,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.77/38.67 [2019-03-28 12:35:08,603 INFO L119 BuchiIsEmpty]: Starting construction of run 75.77/38.67 [2019-03-28 12:35:08,604 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.77/38.67 [2019-03-28 12:35:08,604 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.77/38.67 [2019-03-28 12:35:08,605 INFO L794 eck$LassoCheckResult]: Stem: 1451#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1427#L-1 [232] L-1-->L19: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 1428#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 1425#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 1426#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 1434#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1478#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1488#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1487#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1486#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1485#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1484#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 1483#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1482#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1481#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 1480#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1479#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1465#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 1418#L29 75.77/38.67 [2019-03-28 12:35:08,605 INFO L796 eck$LassoCheckResult]: Loop: 1418#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 1414#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 1415#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 1448#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 1420#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 1412#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1423#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1430#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1431#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1446#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1444#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1442#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 1438#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1439#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 1454#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 1455#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1466#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1467#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 1418#L29 75.77/38.67 [2019-03-28 12:35:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1525648049, now seen corresponding path program 1 times 75.77/38.67 [2019-03-28 12:35:08,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.67 [2019-03-28 12:35:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.67 [2019-03-28 12:35:08,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538802, now seen corresponding path program 2 times 75.77/38.67 [2019-03-28 12:35:08,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.67 [2019-03-28 12:35:08,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.67 [2019-03-28 12:35:08,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:08,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1312599908, now seen corresponding path program 1 times 75.77/38.67 [2019-03-28 12:35:08,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.67 [2019-03-28 12:35:08,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.67 [2019-03-28 12:35:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:08,906 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 75.77/38.67 [2019-03-28 12:35:09,341 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 75.77/38.67 [2019-03-28 12:35:09,476 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 75.77/38.67 [2019-03-28 12:35:09,479 INFO L216 LassoAnalysis]: Preferences: 75.77/38.67 [2019-03-28 12:35:09,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.77/38.67 [2019-03-28 12:35:09,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.77/38.67 [2019-03-28 12:35:09,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.77/38.67 [2019-03-28 12:35:09,480 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.77/38.67 [2019-03-28 12:35:09,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.77/38.67 [2019-03-28 12:35:09,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.77/38.67 [2019-03-28 12:35:09,480 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.77/38.67 [2019-03-28 12:35:09,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 75.77/38.67 [2019-03-28 12:35:09,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.77/38.67 [2019-03-28 12:35:09,481 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.77/38.67 [2019-03-28 12:35:09,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,800 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 75.77/38.67 [2019-03-28 12:35:09,907 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 75.77/38.67 [2019-03-28 12:35:09,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:09,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:10,346 INFO L300 LassoAnalysis]: Preprocessing complete. 75.77/38.67 [2019-03-28 12:35:10,346 INFO L497 LassoAnalysis]: Using template 'affine'. 75.77/38.67 [2019-03-28 12:35:10,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:10,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:10,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:10,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:10,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:10,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:10,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:10,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:10,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:10,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:10,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:10,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:10,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:10,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:10,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:10,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:10,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:10,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:10,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:10,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:10,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:10,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:10,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:10,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:10,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:10,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:10,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:10,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:10,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:10,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:10,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:10,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:10,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:10,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:10,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:10,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:10,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:10,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:10,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:10,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:10,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:10,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:10,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:10,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:10,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:10,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:10,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:10,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:10,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:10,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:10,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:10,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:10,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:10,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:10,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:10,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:10,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:10,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:10,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.77/38.67 [2019-03-28 12:35:10,392 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 75.77/38.67 [2019-03-28 12:35:10,392 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. 75.77/38.67 [2019-03-28 12:35:10,392 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.77/38.67 [2019-03-28 12:35:10,393 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 75.77/38.67 [2019-03-28 12:35:10,394 INFO L518 LassoAnalysis]: Proved termination. 75.77/38.67 [2019-03-28 12:35:10,394 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.77/38.67 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 75.77/38.67 Supporting invariants [] 75.77/38.67 [2019-03-28 12:35:10,474 INFO L297 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed 75.77/38.67 [2019-03-28 12:35:10,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.77/38.67 [2019-03-28 12:35:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:10,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:10,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:10,526 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,527 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 75.77/38.67 [2019-03-28 12:35:10,527 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,534 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,534 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,535 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 75.77/38.67 [2019-03-28 12:35:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:10,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:10,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:10,588 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 75.77/38.67 [2019-03-28 12:35:10,588 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,597 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,598 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,598 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 75.77/38.67 [2019-03-28 12:35:10,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:10,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,627 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,628 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,628 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 75.77/38.67 [2019-03-28 12:35:10,633 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.67 [2019-03-28 12:35:10,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,643 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,643 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,643 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 75.77/38.67 [2019-03-28 12:35:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.77/38.67 [2019-03-28 12:35:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:10,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:10,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:10,812 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 75.77/38.67 [2019-03-28 12:35:10,812 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,821 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,821 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,821 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 75.77/38.67 [2019-03-28 12:35:10,832 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:10,832 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,842 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,843 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,843 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 75.77/38.67 [2019-03-28 12:35:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:10,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:10,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:10,945 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:10,946 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,954 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,955 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,955 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 75.77/38.67 [2019-03-28 12:35:10,974 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.67 [2019-03-28 12:35:10,975 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,985 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:10,986 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:10,986 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:11,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:11,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:11,046 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:11,047 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,055 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,056 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,056 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 75.77/38.67 [2019-03-28 12:35:11,068 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.67 [2019-03-28 12:35:11,069 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,078 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,079 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,079 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,084 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:11,084 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,095 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,095 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,095 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:11,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:11,120 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.67 [2019-03-28 12:35:11,121 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,137 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,137 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,138 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,144 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:11,145 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,156 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,157 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,157 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:11,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:11,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:11,181 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.67 [2019-03-28 12:35:11,182 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,193 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,193 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,193 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,199 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:11,199 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,209 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,210 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,210 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,216 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.67 [2019-03-28 12:35:11,216 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,232 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,233 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,233 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:11,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:11,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:11,260 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 75.77/38.67 [2019-03-28 12:35:11,261 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,273 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,274 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,274 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,279 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:11,279 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,290 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,291 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,291 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,300 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.67 [2019-03-28 12:35:11,301 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,312 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,312 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,312 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 75.77/38.67 [2019-03-28 12:35:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:11,328 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.77/38.67 [2019-03-28 12:35:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:11,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:11,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:11,346 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 75.77/38.67 [2019-03-28 12:35:11,347 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,355 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,356 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,356 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 75.77/38.67 [2019-03-28 12:35:11,360 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:11,360 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,369 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,369 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,369 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 75.77/38.67 [2019-03-28 12:35:11,374 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.67 [2019-03-28 12:35:11,375 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,383 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,384 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 75.77/38.67 [2019-03-28 12:35:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:11,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:11,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:11,406 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 75.77/38.67 [2019-03-28 12:35:11,406 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,417 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,418 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,418 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 75.77/38.67 [2019-03-28 12:35:11,423 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 75.77/38.67 [2019-03-28 12:35:11,424 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,433 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,433 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,433 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 75.77/38.67 [2019-03-28 12:35:11,438 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 75.77/38.67 [2019-03-28 12:35:11,438 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,447 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:11,448 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:11,448 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 75.77/38.67 [2019-03-28 12:35:11,452 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 9 predicates after loop cannibalization 75.77/38.67 [2019-03-28 12:35:11,452 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 9 loop predicates 75.77/38.67 [2019-03-28 12:35:11,452 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 78 states and 89 transitions. cyclomatic complexity: 13 Second operand 7 states. 75.77/38.67 [2019-03-28 12:35:12,098 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 78 states and 89 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 557 states and 581 transitions. Complement of second has 96 states. 75.77/38.67 [2019-03-28 12:35:12,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 13 non-accepting loop states 2 accepting loop states 75.77/38.67 [2019-03-28 12:35:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 75.77/38.67 [2019-03-28 12:35:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 100 transitions. 75.77/38.67 [2019-03-28 12:35:12,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 100 transitions. Stem has 18 letters. Loop has 18 letters. 75.77/38.67 [2019-03-28 12:35:12,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.77/38.67 [2019-03-28 12:35:12,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 100 transitions. Stem has 36 letters. Loop has 18 letters. 75.77/38.67 [2019-03-28 12:35:12,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.77/38.67 [2019-03-28 12:35:12,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 100 transitions. Stem has 18 letters. Loop has 36 letters. 75.77/38.67 [2019-03-28 12:35:12,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.77/38.67 [2019-03-28 12:35:12,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 557 states and 581 transitions. 75.77/38.67 [2019-03-28 12:35:12,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 75.77/38.67 [2019-03-28 12:35:12,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 557 states to 248 states and 265 transitions. 75.77/38.67 [2019-03-28 12:35:12,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 75.77/38.67 [2019-03-28 12:35:12,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 75.77/38.67 [2019-03-28 12:35:12,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 265 transitions. 75.77/38.67 [2019-03-28 12:35:12,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 75.77/38.67 [2019-03-28 12:35:12,119 INFO L706 BuchiCegarLoop]: Abstraction has 248 states and 265 transitions. 75.77/38.67 [2019-03-28 12:35:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 265 transitions. 75.77/38.67 [2019-03-28 12:35:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 88. 75.77/38.67 [2019-03-28 12:35:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. 75.77/38.67 [2019-03-28 12:35:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. 75.77/38.67 [2019-03-28 12:35:12,125 INFO L729 BuchiCegarLoop]: Abstraction has 88 states and 100 transitions. 75.77/38.67 [2019-03-28 12:35:12,125 INFO L609 BuchiCegarLoop]: Abstraction has 88 states and 100 transitions. 75.77/38.67 [2019-03-28 12:35:12,125 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 75.77/38.67 [2019-03-28 12:35:12,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 100 transitions. 75.77/38.67 [2019-03-28 12:35:12,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 75.77/38.67 [2019-03-28 12:35:12,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.77/38.67 [2019-03-28 12:35:12,127 INFO L119 BuchiIsEmpty]: Starting construction of run 75.77/38.67 [2019-03-28 12:35:12,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 75.77/38.67 [2019-03-28 12:35:12,128 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 75.77/38.67 [2019-03-28 12:35:12,129 INFO L794 eck$LassoCheckResult]: Stem: 2858#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 2833#L-1 [232] L-1-->L19: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 2834#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 2831#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 2832#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 2880#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2829#L23-1 75.77/38.67 [2019-03-28 12:35:12,130 INFO L796 eck$LassoCheckResult]: Loop: 2829#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2836#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2837#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2853#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2851#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2849#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 2845#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2846#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2861#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 2862#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2865#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2859#L24-2 [177] L24-2-->L25: Formula: (< |v_ULTIMATE.start_main_#t~mem12_4| |v_ULTIMATE.start_main_#t~mem11_4|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_4|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_4|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 2844#L25 [120] L25-->L25-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 2842#L25-1 [320] L25-1-->L26: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_15) (<= (+ v_ULTIMATE.start_main_~y~0.offset_15 4) (select |v_#length_44| v_ULTIMATE.start_main_~y~0.base_20)) (= (store |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20 (store (select |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20) v_ULTIMATE.start_main_~y~0.offset_15 |v_ULTIMATE.start_main_#t~mem13_6|)) |v_#memory_int_34|) (= 1 (select |v_#valid_56| v_ULTIMATE.start_main_~y~0.base_20))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 2843#L26 [322] L26-->L27: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 |v_ULTIMATE.start_main_#t~nondet14_5|))) (= (select |v_#valid_58| v_ULTIMATE.start_main_~x~0.base_26) 1)) InVars {ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_4|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14, #memory_int] 2819#L27 [153] L27-->L27-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 2817#L27-1 [324] L27-1-->L24-4: Formula: (and (= (select |v_#valid_60| v_ULTIMATE.start_main_~z~0.base_24) 1) (= (store |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24 (store (select |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24) v_ULTIMATE.start_main_~z~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem15_6| (- 1)))) |v_#memory_int_42|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_18) (<= (+ v_ULTIMATE.start_main_~z~0.offset_18 4) (select |v_#length_48| v_ULTIMATE.start_main_~z~0.base_24))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_43|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_42|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 2818#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2879#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2878#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2877#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2876#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2875#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2874#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 2873#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2872#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2871#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 2870#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2868#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2869#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 2822#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 2823#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 2904#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 2903#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 2902#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 2901#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2900#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2899#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2898#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2897#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2896#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2895#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 2894#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2893#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 2892#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 2864#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2866#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2860#L24-2 [205] L24-2-->L29: Formula: (>= |v_ULTIMATE.start_main_#t~mem12_6| |v_ULTIMATE.start_main_#t~mem11_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 2824#L29 [108] L29-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 2820#L29-1 [321] L29-1-->L30: Formula: (and (= (store |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23 (store (select |v_#memory_int_37| v_ULTIMATE.start_main_~z~0.base_23) v_ULTIMATE.start_main_~z~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem16_6| (- 1)))) |v_#memory_int_36|) (= (select |v_#valid_57| v_ULTIMATE.start_main_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_main_~z~0.offset_17) (<= (+ v_ULTIMATE.start_main_~z~0.offset_17 4) (select |v_#length_45| v_ULTIMATE.start_main_~z~0.base_23))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_23, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_17, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 2821#L30 [323] L30-->L31: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_main_~x~0.base_27)) (= (store |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_41| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet17_5|)) |v_#memory_int_40|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~x~0.base_27))) InVars {#valid=|v_#valid_59|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{#valid=|v_#valid_59|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, #length=|v_#length_47|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet17] 2856#L31 [174] L31-->L31-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_22)) (= (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_22) 1) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_39|} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 2825#L31-1 [325] L31-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_main_~y~0.base_21)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (select |v_#valid_61| v_ULTIMATE.start_main_~y~0.base_21) 1) (= (store |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21 (store (select |v_#memory_int_45| v_ULTIMATE.start_main_~y~0.base_21) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem18_6| (- 1)))) |v_#memory_int_44|)) InVars {#valid=|v_#valid_61|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} OutVars{#valid=|v_#valid_61|, #memory_int=|v_#memory_int_44|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_21, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_49|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem18] 2826#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2829#L23-1 75.77/38.67 [2019-03-28 12:35:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash 967687202, now seen corresponding path program 1 times 75.77/38.67 [2019-03-28 12:35:12,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.67 [2019-03-28 12:35:12,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.67 [2019-03-28 12:35:12,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash -486376724, now seen corresponding path program 1 times 75.77/38.67 [2019-03-28 12:35:12,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.67 [2019-03-28 12:35:12,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.67 [2019-03-28 12:35:12,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 996815949, now seen corresponding path program 1 times 75.77/38.67 [2019-03-28 12:35:12,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.77/38.67 [2019-03-28 12:35:12,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.77/38.67 [2019-03-28 12:35:12,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.77/38.67 [2019-03-28 12:35:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:14,197 WARN L188 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 175 DAG size of output: 170 75.77/38.67 [2019-03-28 12:35:14,498 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 91 75.77/38.67 [2019-03-28 12:35:14,819 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 75.77/38.67 [2019-03-28 12:35:14,955 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 83 75.77/38.67 [2019-03-28 12:35:14,959 INFO L216 LassoAnalysis]: Preferences: 75.77/38.67 [2019-03-28 12:35:14,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.77/38.67 [2019-03-28 12:35:14,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.77/38.67 [2019-03-28 12:35:14,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.77/38.67 [2019-03-28 12:35:14,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.77/38.67 [2019-03-28 12:35:14,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.77/38.67 [2019-03-28 12:35:14,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.77/38.67 [2019-03-28 12:35:14,960 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.77/38.67 [2019-03-28 12:35:14,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 75.77/38.67 [2019-03-28 12:35:14,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.77/38.67 [2019-03-28 12:35:14,961 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.77/38.67 [2019-03-28 12:35:14,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:14,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:15,257 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 75.77/38.67 [2019-03-28 12:35:15,398 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 75.77/38.67 [2019-03-28 12:35:15,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:15,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:15,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:15,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:15,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.77/38.67 [2019-03-28 12:35:15,781 INFO L300 LassoAnalysis]: Preprocessing complete. 75.77/38.67 [2019-03-28 12:35:15,782 INFO L497 LassoAnalysis]: Using template 'affine'. 75.77/38.67 [2019-03-28 12:35:15,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.77/38.67 [2019-03-28 12:35:15,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.77/38.67 [2019-03-28 12:35:15,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.77/38.67 Termination analysis: LINEAR_WITH_GUESSES 75.77/38.67 Number of strict supporting invariants: 0 75.77/38.67 Number of non-strict supporting invariants: 1 75.77/38.67 Consider only non-deceasing supporting invariants: true 75.77/38.67 Simplify termination arguments: true 75.77/38.67 Simplify supporting invariants: trueOverapproximate stem: false 75.77/38.67 [2019-03-28 12:35:15,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.77/38.67 [2019-03-28 12:35:15,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.77/38.67 [2019-03-28 12:35:15,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.77/38.67 [2019-03-28 12:35:15,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.77/38.67 [2019-03-28 12:35:15,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.77/38.67 [2019-03-28 12:35:15,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.77/38.67 [2019-03-28 12:35:15,919 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.77/38.67 [2019-03-28 12:35:15,924 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 75.77/38.67 [2019-03-28 12:35:15,924 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 75.77/38.67 [2019-03-28 12:35:15,925 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.77/38.67 [2019-03-28 12:35:15,925 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 75.77/38.67 [2019-03-28 12:35:15,926 INFO L518 LassoAnalysis]: Proved termination. 75.77/38.67 [2019-03-28 12:35:15,926 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.77/38.67 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 75.77/38.67 Supporting invariants [] 75.77/38.67 [2019-03-28 12:35:16,046 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 75.77/38.67 [2019-03-28 12:35:16,048 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.77/38.67 [2019-03-28 12:35:16,048 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.77/38.67 [2019-03-28 12:35:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.77/38.67 [2019-03-28 12:35:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:16,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:16,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:16,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:16,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:16,144 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,145 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.77/38.67 [2019-03-28 12:35:16,150 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,164 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,164 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,164 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 75.77/38.67 [2019-03-28 12:35:16,229 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.77/38.67 [2019-03-28 12:35:16,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.77/38.67 [2019-03-28 12:35:16,234 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,249 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,250 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,250 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 75.77/38.67 [2019-03-28 12:35:16,297 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 75.77/38.67 [2019-03-28 12:35:16,298 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,312 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 75.77/38.67 [2019-03-28 12:35:16,312 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,334 INFO L497 ElimStorePlain]: treesize reduction 29, result has 40.8 percent of original size 75.77/38.67 [2019-03-28 12:35:16,335 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,335 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:17 75.77/38.67 [2019-03-28 12:35:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. 75.77/38.67 [2019-03-28 12:35:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:16,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:16,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:16,534 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,534 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.77/38.67 [2019-03-28 12:35:16,536 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,547 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,548 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,548 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 75.77/38.67 [2019-03-28 12:35:16,565 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.77/38.67 [2019-03-28 12:35:16,565 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.77/38.67 [2019-03-28 12:35:16,570 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,587 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,588 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,588 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 75.77/38.67 [2019-03-28 12:35:16,613 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 75.77/38.67 [2019-03-28 12:35:16,614 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,622 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 75.77/38.67 [2019-03-28 12:35:16,622 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,645 INFO L497 ElimStorePlain]: treesize reduction 29, result has 40.8 percent of original size 75.77/38.67 [2019-03-28 12:35:16,646 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,646 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:17 75.77/38.67 [2019-03-28 12:35:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:16,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:16,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:16,694 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,694 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.77/38.67 [2019-03-28 12:35:16,696 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,708 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,709 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,709 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 75.77/38.67 [2019-03-28 12:35:16,723 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.77/38.67 [2019-03-28 12:35:16,723 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,727 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.77/38.67 [2019-03-28 12:35:16,728 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,741 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,741 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,742 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 75.77/38.67 [2019-03-28 12:35:16,762 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 75.77/38.67 [2019-03-28 12:35:16,763 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,769 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 75.77/38.67 [2019-03-28 12:35:16,769 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,789 INFO L497 ElimStorePlain]: treesize reduction 29, result has 40.8 percent of original size 75.77/38.67 [2019-03-28 12:35:16,790 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,790 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:17 75.77/38.67 [2019-03-28 12:35:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:16,834 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.77/38.67 [2019-03-28 12:35:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.77/38.67 [2019-03-28 12:35:16,876 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.77/38.67 [2019-03-28 12:35:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:16,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:16,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:16,927 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,927 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 75.77/38.67 [2019-03-28 12:35:16,929 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,936 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,936 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,936 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 75.77/38.67 [2019-03-28 12:35:16,971 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.77/38.67 [2019-03-28 12:35:16,972 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,977 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.77/38.67 [2019-03-28 12:35:16,978 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.77/38.67 [2019-03-28 12:35:16,983 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,996 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:16,996 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.77/38.67 [2019-03-28 12:35:16,997 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.77/38.67 [2019-03-28 12:35:17,032 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.77/38.67 [2019-03-28 12:35:17,033 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:17,058 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:17,058 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.77/38.67 [2019-03-28 12:35:17,059 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:17,067 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.77/38.67 [2019-03-28 12:35:17,067 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:17,103 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.77/38.67 [2019-03-28 12:35:17,104 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:17,104 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.77/38.67 [2019-03-28 12:35:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.77/38.67 [2019-03-28 12:35:17,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.77/38.67 [2019-03-28 12:35:17,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.77/38.67 [2019-03-28 12:35:17,348 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:17,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 75.77/38.67 [2019-03-28 12:35:17,349 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:17,355 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.77/38.67 [2019-03-28 12:35:17,355 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.77/38.67 [2019-03-28 12:35:17,355 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 75.77/38.67 [2019-03-28 12:35:17,378 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.77/38.67 [2019-03-28 12:35:17,379 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.77/38.67 [2019-03-28 12:35:17,383 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:17,383 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,387 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:17,388 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,401 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,402 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,402 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:17,418 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:17,419 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,429 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:17,429 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,455 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,456 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:17,457 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,512 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:17,513 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,513 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:17,522 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:17,523 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:17,524 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,536 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,537 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:17,538 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,557 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,557 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,557 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:17,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:17,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:17,764 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,764 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:17,765 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,771 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,771 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,772 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:17,793 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:17,793 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,798 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:17,798 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,802 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:17,803 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,816 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,816 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,816 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:17,844 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,844 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:17,845 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,854 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:17,855 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:17,863 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,899 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:17,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,900 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:17,908 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:17,908 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:17,909 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,920 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,920 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:17,921 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,935 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,935 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,935 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:17,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:17,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:17,981 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,981 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 75.89/38.67 [2019-03-28 12:35:17,982 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,987 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:17,987 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:17,988 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,008 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:18,009 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,018 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,019 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,023 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,023 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,035 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,036 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,036 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,048 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,073 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,073 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:18,074 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,081 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,081 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,119 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:18,120 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,120 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:18,128 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:18,129 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:18,129 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,140 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,140 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,142 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,157 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,158 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,158 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:18,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:18,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:18,221 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,221 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:18,222 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,231 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,232 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,232 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:18,257 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,263 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,263 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,271 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,272 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,288 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,288 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,289 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,301 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,302 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,339 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,339 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:18,340 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,349 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,350 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,395 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:18,396 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,397 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:18,404 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:18,405 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:18,405 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,415 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,416 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,417 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,432 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,433 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,433 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:18,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:18,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:18,481 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,481 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:18,483 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,490 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,490 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,490 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,514 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:18,514 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,520 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,521 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,526 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,526 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,564 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,565 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,565 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,594 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,594 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:18,595 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,604 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,604 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,611 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,611 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,647 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:18,648 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,648 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:18,654 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:18,655 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:18,656 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,664 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,665 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,666 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,679 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,680 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,680 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:18,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:18,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:18,725 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,725 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:18,726 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,731 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,732 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,732 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,754 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,754 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,759 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:18,760 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,764 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,764 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,777 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,777 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,778 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,808 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,809 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:18,810 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,818 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,819 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,826 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,827 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,866 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:18,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,867 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:18,874 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:18,875 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:18,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,891 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,892 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:18,893 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,911 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,912 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,912 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:18,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:18,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:18,965 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,966 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:18,967 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,972 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:18,973 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:18,973 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:18,995 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:18,995 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,000 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,000 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,006 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:19,006 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,022 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,022 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,023 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,055 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,055 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:19,056 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,067 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,068 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,074 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,075 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,122 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:19,123 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,123 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:19,130 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:19,131 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:19,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,144 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,144 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,145 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,162 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,162 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,163 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:19,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:19,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:19,217 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,218 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:19,218 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,226 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,226 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,226 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,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 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:19,250 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,255 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,256 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,260 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,261 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,277 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,277 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,277 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,291 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,291 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,301 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,301 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,327 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,328 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:19,329 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,376 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:19,377 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,377 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:19,385 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:19,386 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:19,387 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,399 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,399 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,400 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,419 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,419 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,420 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:19,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:19,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:19,472 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,472 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:19,473 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,479 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,479 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,479 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,499 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,499 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,504 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:19,504 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,508 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,509 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,522 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,523 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,523 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,533 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,533 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,558 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,559 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:19,559 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,566 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,567 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,607 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:19,608 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,608 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:19,615 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:19,616 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:19,616 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,626 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,626 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,627 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,643 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,643 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,643 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:19,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:19,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:19,690 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,690 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 75.89/38.67 [2019-03-28 12:35:19,691 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,697 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,697 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,697 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,718 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,719 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,724 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,725 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,729 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:19,730 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,745 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,746 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,746 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,757 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,758 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,767 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,768 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,790 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,790 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:19,791 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,831 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:19,831 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,832 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:19,838 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:19,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:19,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,850 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,850 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:19,851 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,866 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,867 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:19,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:19,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:19,923 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 75.89/38.67 [2019-03-28 12:35:19,925 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,932 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,932 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,932 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 75.89/38.67 [2019-03-28 12:35:19,960 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:19,961 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,974 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,975 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,980 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:19,981 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,997 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:19,998 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:19,998 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,030 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,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 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:20,032 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,042 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,043 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,049 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,050 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,088 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:20,089 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,090 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:20,096 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:20,097 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:20,098 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,107 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,107 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,108 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,122 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,122 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:20,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:20,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:20,164 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,165 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:20,165 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,171 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,171 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,171 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,190 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,191 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,196 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,200 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:20,201 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,213 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,213 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,213 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,238 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,238 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:20,239 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,248 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,248 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,255 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,255 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,295 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:20,295 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,296 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:20,302 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:20,303 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:20,303 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,313 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,313 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,314 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,328 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,329 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,329 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:20,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:20,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:20,374 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,374 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 75.89/38.67 [2019-03-28 12:35:20,375 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,380 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,380 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,380 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,398 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:20,398 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,403 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,403 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,407 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,407 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,419 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,420 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,420 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,429 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,430 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,439 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,439 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,459 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,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 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:20,461 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,500 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:20,501 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,501 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:20,509 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:20,509 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:20,510 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,522 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,523 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,524 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,542 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,542 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,543 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:20,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:20,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:20,598 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,599 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:20,600 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,607 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,607 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,607 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,630 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,636 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,637 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,642 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:20,642 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,658 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,659 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,659 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,671 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,671 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,682 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,683 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,707 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,707 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:20,708 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,748 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:20,748 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,749 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:20,755 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:20,756 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:20,756 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,785 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,785 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,786 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,809 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,809 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,809 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:20,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:20,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:20,853 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,853 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:20,854 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,860 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,860 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,860 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,880 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,880 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,885 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:20,885 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,889 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:20,889 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,902 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,903 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,903 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:20,913 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,913 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,922 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:20,922 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,943 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:20,944 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:20,945 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,988 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:20,988 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:20,989 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:20,997 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:20,998 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:20,998 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,011 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,011 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,012 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,030 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,031 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,031 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:21,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:21,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:21,087 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,088 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:21,089 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,096 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,096 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,097 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:21,119 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:21,119 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,125 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,125 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,130 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,131 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,144 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,145 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,145 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:21,156 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,156 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,168 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,192 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,192 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:21,193 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,234 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:21,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,235 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:21,242 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:21,243 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:21,244 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,254 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,255 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,256 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,272 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,273 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,273 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:21,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:21,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:21,352 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,352 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:21,353 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,360 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,360 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,361 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:21,389 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:21,389 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,395 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,395 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,400 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,400 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,417 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,418 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,418 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:21,450 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,451 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:21,451 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,462 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,463 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,470 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,470 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,522 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:21,523 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,523 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:21,530 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:21,531 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:21,532 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,544 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,544 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,545 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,563 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,564 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,564 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:21,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:21,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:21,618 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:21,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,626 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,626 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,627 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:21,646 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:21,647 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,652 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,652 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,657 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,658 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,674 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,675 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,675 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:21,705 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,706 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:21,707 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,718 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,719 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,725 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,726 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,771 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:21,772 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,772 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:21,786 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:21,787 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:21,787 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,800 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,800 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.67 [2019-03-28 12:35:21,801 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,827 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,828 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,828 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.67 [2019-03-28 12:35:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.67 [2019-03-28 12:35:21,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.67 [2019-03-28 12:35:21,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.67 [2019-03-28 12:35:21,887 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,887 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 75.89/38.67 [2019-03-28 12:35:21,888 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,896 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,897 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,897 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 75.89/38.67 [2019-03-28 12:35:21,923 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,924 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,929 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.67 [2019-03-28 12:35:21,930 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,934 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.67 [2019-03-28 12:35:21,935 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,950 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:21,951 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.67 [2019-03-28 12:35:21,951 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.67 [2019-03-28 12:35:22,017 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:22,017 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.67 [2019-03-28 12:35:22,018 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:22,030 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:22,031 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:22,038 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.67 [2019-03-28 12:35:22,038 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:22,078 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.67 [2019-03-28 12:35:22,079 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.67 [2019-03-28 12:35:22,079 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.67 [2019-03-28 12:35:22,087 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.67 [2019-03-28 12:35:22,087 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.67 [2019-03-28 12:35:22,088 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.67 [2019-03-28 12:35:22,101 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.67 [2019-03-28 12:35:22,101 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,102 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,119 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,120 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.68 [2019-03-28 12:35:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:22,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:22,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:22,163 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,164 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 75.89/38.68 [2019-03-28 12:35:22,165 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,173 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,173 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,173 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 75.89/38.68 [2019-03-28 12:35:22,194 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.68 [2019-03-28 12:35:22,194 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,199 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 75.89/38.68 [2019-03-28 12:35:22,200 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,204 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 75.89/38.68 [2019-03-28 12:35:22,204 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,226 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,226 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,227 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 75.89/38.68 [2019-03-28 12:35:22,258 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,259 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 75.89/38.68 [2019-03-28 12:35:22,260 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,270 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,270 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,278 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,279 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,328 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.68 [2019-03-28 12:35:22,328 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,329 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.68 [2019-03-28 12:35:22,336 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.68 [2019-03-28 12:35:22,337 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.68 [2019-03-28 12:35:22,338 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,349 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,350 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,351 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,367 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,368 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,368 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.68 [2019-03-28 12:35:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:22,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:22,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:22,430 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,431 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 56 75.89/38.68 [2019-03-28 12:35:22,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,460 INFO L497 ElimStorePlain]: treesize reduction 35, result has 36.4 percent of original size 75.89/38.68 [2019-03-28 12:35:22,461 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,461 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 75.89/38.68 [2019-03-28 12:35:22,483 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,484 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,509 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,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 24 treesize of output 49 75.89/38.68 [2019-03-28 12:35:22,510 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,517 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,517 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,555 INFO L497 ElimStorePlain]: treesize reduction 51, result has 42.7 percent of original size 75.89/38.68 [2019-03-28 12:35:22,556 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,556 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:24 75.89/38.68 [2019-03-28 12:35:22,562 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.68 [2019-03-28 12:35:22,563 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.68 [2019-03-28 12:35:22,563 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,572 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,572 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,573 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,587 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,587 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,588 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.68 [2019-03-28 12:35:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:22,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:22,676 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,677 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 75.89/38.68 [2019-03-28 12:35:22,679 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,723 INFO L497 ElimStorePlain]: treesize reduction 40, result has 41.2 percent of original size 75.89/38.68 [2019-03-28 12:35:22,724 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,724 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 75.89/38.68 [2019-03-28 12:35:22,731 INFO L172 IndexEqualityManager]: detected equality via solver 75.89/38.68 [2019-03-28 12:35:22,731 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 75.89/38.68 [2019-03-28 12:35:22,732 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,742 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,743 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,744 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,757 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,757 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,758 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:28 75.89/38.68 [2019-03-28 12:35:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:22,801 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.89/38.68 [2019-03-28 12:35:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:22,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:22,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:22,839 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,840 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 75.89/38.68 [2019-03-28 12:35:22,841 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,851 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,851 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,851 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 75.89/38.68 [2019-03-28 12:35:22,863 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.89/38.68 [2019-03-28 12:35:22,864 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,868 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 75.89/38.68 [2019-03-28 12:35:22,868 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,881 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:22,882 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:22,882 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 75.89/38.68 [2019-03-28 12:35:22,898 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 19 predicates after loop cannibalization 75.89/38.68 [2019-03-28 12:35:22,898 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 75.89/38.68 [2019-03-28 12:35:22,898 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 88 states and 100 transitions. cyclomatic complexity: 13 Second operand 8 states. 75.89/38.68 [2019-03-28 12:35:24,467 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 88 states and 100 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 1172 states and 1209 transitions. Complement of second has 228 states. 75.89/38.68 [2019-03-28 12:35:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 21 non-accepting loop states 2 accepting loop states 75.89/38.68 [2019-03-28 12:35:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 75.89/38.68 [2019-03-28 12:35:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 156 transitions. 75.89/38.68 [2019-03-28 12:35:24,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 156 transitions. Stem has 6 letters. Loop has 54 letters. 75.89/38.68 [2019-03-28 12:35:24,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.89/38.68 [2019-03-28 12:35:24,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 156 transitions. Stem has 60 letters. Loop has 54 letters. 75.89/38.68 [2019-03-28 12:35:24,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.89/38.68 [2019-03-28 12:35:24,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 156 transitions. Stem has 6 letters. Loop has 108 letters. 75.89/38.68 [2019-03-28 12:35:24,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.89/38.68 [2019-03-28 12:35:24,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1172 states and 1209 transitions. 75.89/38.68 [2019-03-28 12:35:24,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 75.89/38.68 [2019-03-28 12:35:24,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1172 states to 42 states and 49 transitions. 75.89/38.68 [2019-03-28 12:35:24,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 75.89/38.68 [2019-03-28 12:35:24,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 75.89/38.68 [2019-03-28 12:35:24,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. 75.89/38.68 [2019-03-28 12:35:24,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.89/38.68 [2019-03-28 12:35:24,497 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. 75.89/38.68 [2019-03-28 12:35:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. 75.89/38.68 [2019-03-28 12:35:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. 75.89/38.68 [2019-03-28 12:35:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 75.89/38.68 [2019-03-28 12:35:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. 75.89/38.68 [2019-03-28 12:35:24,499 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. 75.89/38.68 [2019-03-28 12:35:24,500 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. 75.89/38.68 [2019-03-28 12:35:24,500 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 75.89/38.68 [2019-03-28 12:35:24,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. 75.89/38.68 [2019-03-28 12:35:24,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 75.89/38.68 [2019-03-28 12:35:24,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.89/38.68 [2019-03-28 12:35:24,500 INFO L119 BuchiIsEmpty]: Starting construction of run 75.89/38.68 [2019-03-28 12:35:24,501 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 75.89/38.68 [2019-03-28 12:35:24,501 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.89/38.68 [2019-03-28 12:35:24,502 INFO L794 eck$LassoCheckResult]: Stem: 8808#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 8806#L-1 [233] L-1-->L19: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 8801#L19 [314] L19-->L20: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25) 1) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 8802#L20 [315] L20-->L21: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 8803#L21 [316] L21-->L24-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 8795#L24-4 75.89/38.68 [2019-03-28 12:35:24,502 INFO L796 eck$LassoCheckResult]: Loop: 8795#L24-4 [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 8804#L23-1 [251] L23-1-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 8807#L23-2 [168] L23-2-->L23-3: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 8805#L23-3 [141] L23-3-->L23-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_7)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 8800#L23-4 [259] L23-4-->L23-6: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< 0 |v_ULTIMATE.start_main_#t~mem7_3|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 8799#L23-6 [257] L23-6-->L23-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 8798#L23-7 [129] L23-7-->L23-8: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 8792#L23-8 [123] L23-8-->L23-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 8793#L23-9 [264] L23-9-->L23-11: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem9_3|) |v_ULTIMATE.start_main_#t~short10_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_4|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 8811#L23-11 [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~short8] 8812#L24 [182] L24-->L24-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 8813#L24-1 [179] L24-1-->L24-2: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 8809#L24-2 [177] L24-2-->L25: Formula: (< |v_ULTIMATE.start_main_#t~mem12_4| |v_ULTIMATE.start_main_#t~mem11_4|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_4|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_4|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 8810#L25 [120] L25-->L25-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 8814#L25-1 [320] L25-1-->L26: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_15) (<= (+ v_ULTIMATE.start_main_~y~0.offset_15 4) (select |v_#length_44| v_ULTIMATE.start_main_~y~0.base_20)) (= (store |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20 (store (select |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20) v_ULTIMATE.start_main_~y~0.offset_15 |v_ULTIMATE.start_main_#t~mem13_6|)) |v_#memory_int_34|) (= 1 (select |v_#valid_56| v_ULTIMATE.start_main_~y~0.base_20))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 8796#L26 [322] L26-->L27: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 |v_ULTIMATE.start_main_#t~nondet14_5|))) (= (select |v_#valid_58| v_ULTIMATE.start_main_~x~0.base_26) 1)) InVars {ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_4|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14, #memory_int] 8797#L27 [153] L27-->L27-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 8794#L27-1 [324] L27-1-->L24-4: Formula: (and (= (select |v_#valid_60| v_ULTIMATE.start_main_~z~0.base_24) 1) (= (store |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24 (store (select |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24) v_ULTIMATE.start_main_~z~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem15_6| (- 1)))) |v_#memory_int_42|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_18) (<= (+ v_ULTIMATE.start_main_~z~0.offset_18 4) (select |v_#length_48| v_ULTIMATE.start_main_~z~0.base_24))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_43|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_42|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 8795#L24-4 75.89/38.68 [2019-03-28 12:35:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.89/38.68 [2019-03-28 12:35:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 4 times 75.89/38.68 [2019-03-28 12:35:24,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.89/38.68 [2019-03-28 12:35:24,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.89/38.68 [2019-03-28 12:35:24,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.89/38.68 [2019-03-28 12:35:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1770492400, now seen corresponding path program 1 times 75.89/38.68 [2019-03-28 12:35:24,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.89/38.68 [2019-03-28 12:35:24,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.89/38.68 [2019-03-28 12:35:24,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:24,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.89/38.68 [2019-03-28 12:35:24,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1867590383, now seen corresponding path program 1 times 75.89/38.68 [2019-03-28 12:35:24,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.89/38.68 [2019-03-28 12:35:24,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.89/38.68 [2019-03-28 12:35:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.89/38.68 [2019-03-28 12:35:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:24,804 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 75.89/38.68 [2019-03-28 12:35:25,149 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 75.89/38.68 [2019-03-28 12:35:25,272 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 77 75.89/38.68 [2019-03-28 12:35:25,276 INFO L216 LassoAnalysis]: Preferences: 75.89/38.68 [2019-03-28 12:35:25,276 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.89/38.68 [2019-03-28 12:35:25,276 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.89/38.68 [2019-03-28 12:35:25,276 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.89/38.68 [2019-03-28 12:35:25,276 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.89/38.68 [2019-03-28 12:35:25,276 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.89/38.68 [2019-03-28 12:35:25,276 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.89/38.68 [2019-03-28 12:35:25,277 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.89/38.68 [2019-03-28 12:35:25,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 75.89/38.68 [2019-03-28 12:35:25,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.89/38.68 [2019-03-28 12:35:25,277 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.89/38.68 [2019-03-28 12:35:25,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,531 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 75.89/38.68 [2019-03-28 12:35:25,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:25,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.89/38.68 [2019-03-28 12:35:26,020 INFO L300 LassoAnalysis]: Preprocessing complete. 75.89/38.68 [2019-03-28 12:35:26,021 INFO L497 LassoAnalysis]: Using template 'affine'. 75.89/38.68 [2019-03-28 12:35:26,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.89/38.68 [2019-03-28 12:35:26,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.89/38.68 Termination analysis: LINEAR_WITH_GUESSES 75.89/38.68 Number of strict supporting invariants: 0 75.89/38.68 Number of non-strict supporting invariants: 1 75.89/38.68 Consider only non-deceasing supporting invariants: true 75.89/38.68 Simplify termination arguments: true 75.89/38.68 Simplify supporting invariants: trueOverapproximate stem: false 75.89/38.68 [2019-03-28 12:35:26,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.89/38.68 [2019-03-28 12:35:26,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.89/38.68 [2019-03-28 12:35:26,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.89/38.68 [2019-03-28 12:35:26,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.89/38.68 [2019-03-28 12:35:26,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.89/38.68 [2019-03-28 12:35:26,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.89/38.68 [2019-03-28 12:35:26,089 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.89/38.68 [2019-03-28 12:35:26,095 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 75.89/38.68 [2019-03-28 12:35:26,095 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. 75.89/38.68 [2019-03-28 12:35:26,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.89/38.68 [2019-03-28 12:35:26,096 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 75.89/38.68 [2019-03-28 12:35:26,096 INFO L518 LassoAnalysis]: Proved termination. 75.89/38.68 [2019-03-28 12:35:26,096 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.89/38.68 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 75.89/38.68 Supporting invariants [] 75.89/38.68 [2019-03-28 12:35:26,183 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 75.89/38.68 [2019-03-28 12:35:26,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.89/38.68 [2019-03-28 12:35:26,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.89/38.68 [2019-03-28 12:35:26,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.89/38.68 [2019-03-28 12:35:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.89/38.68 [2019-03-28 12:35:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:26,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:26,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:26,227 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 75.89/38.68 [2019-03-28 12:35:26,227 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:26,233 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:26,233 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:26,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 75.89/38.68 [2019-03-28 12:35:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:26,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:26,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:26,424 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:26,425 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 88 75.89/38.68 [2019-03-28 12:35:26,429 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:26,472 INFO L497 ElimStorePlain]: treesize reduction 61, result has 43.5 percent of original size 75.89/38.68 [2019-03-28 12:35:26,472 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:26,473 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 75.89/38.68 [2019-03-28 12:35:26,532 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:26,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 75.89/38.68 [2019-03-28 12:35:26,534 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:26,558 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:26,559 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 75.89/38.68 [2019-03-28 12:35:26,560 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:26,647 INFO L497 ElimStorePlain]: treesize reduction 32, result has 80.8 percent of original size 75.89/38.68 [2019-03-28 12:35:26,648 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:26,648 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:121 75.89/38.68 [2019-03-28 12:35:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.89/38.68 [2019-03-28 12:35:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:27,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:27,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:27,424 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:27,424 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 88 75.89/38.68 [2019-03-28 12:35:27,431 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,477 INFO L497 ElimStorePlain]: treesize reduction 89, result has 34.6 percent of original size 75.89/38.68 [2019-03-28 12:35:27,477 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,477 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 75.89/38.68 [2019-03-28 12:35:27,505 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:27,505 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 75.89/38.68 [2019-03-28 12:35:27,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,532 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:27,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 75.89/38.68 [2019-03-28 12:35:27,534 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,652 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 75.89/38.68 [2019-03-28 12:35:27,652 INFO L497 ElimStorePlain]: treesize reduction 32, result has 80.8 percent of original size 75.89/38.68 [2019-03-28 12:35:27,653 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,653 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:121 75.89/38.68 [2019-03-28 12:35:27,697 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:27,698 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 87 75.89/38.68 [2019-03-28 12:35:27,701 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,716 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 75.89/38.68 [2019-03-28 12:35:27,717 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,730 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 75.89/38.68 [2019-03-28 12:35:27,730 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,757 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:27,758 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 87 75.89/38.68 [2019-03-28 12:35:27,761 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,943 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 75.89/38.68 [2019-03-28 12:35:27,944 INFO L497 ElimStorePlain]: treesize reduction 240, result has 33.1 percent of original size 75.89/38.68 [2019-03-28 12:35:27,944 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.68 [2019-03-28 12:35:27,945 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:219, output treesize:101 75.89/38.68 [2019-03-28 12:35:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:28,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:28,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:28,585 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:28,586 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 85 75.89/38.68 [2019-03-28 12:35:28,590 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:28,626 INFO L497 ElimStorePlain]: treesize reduction 61, result has 39.6 percent of original size 75.89/38.68 [2019-03-28 12:35:28,626 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:28,626 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:36 75.89/38.68 [2019-03-28 12:35:28,697 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:28,698 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 65 75.89/38.68 [2019-03-28 12:35:28,699 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:28,720 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:28,720 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 65 75.89/38.68 [2019-03-28 12:35:28,722 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:28,797 INFO L497 ElimStorePlain]: treesize reduction 32, result has 78.2 percent of original size 75.89/38.68 [2019-03-28 12:35:28,798 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:28,798 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:101 75.89/38.68 [2019-03-28 12:35:28,997 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:28,998 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 84 75.89/38.68 [2019-03-28 12:35:29,001 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:29,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 75.89/38.68 [2019-03-28 12:35:29,015 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:29,053 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:29,053 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 84 75.89/38.68 [2019-03-28 12:35:29,056 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:29,064 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 75.89/38.68 [2019-03-28 12:35:29,065 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:29,228 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 75.89/38.68 [2019-03-28 12:35:29,228 INFO L497 ElimStorePlain]: treesize reduction 215, result has 33.6 percent of original size 75.89/38.68 [2019-03-28 12:35:29,229 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 75.89/38.68 [2019-03-28 12:35:29,229 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:199, output treesize:92 75.89/38.68 [2019-03-28 12:35:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:29,560 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.89/38.68 [2019-03-28 12:35:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:29,572 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.89/38.68 [2019-03-28 12:35:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:29,585 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.89/38.68 [2019-03-28 12:35:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:29,597 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.89/38.68 [2019-03-28 12:35:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:29,608 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.89/38.68 [2019-03-28 12:35:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.89/38.68 [2019-03-28 12:35:29,620 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.89/38.68 [2019-03-28 12:35:29,621 INFO L98 LoopCannibalizer]: 25 predicates before loop cannibalization 35 predicates after loop cannibalization 75.89/38.68 [2019-03-28 12:35:29,621 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 35 loop predicates 75.89/38.68 [2019-03-28 12:35:29,621 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8 Second operand 13 states. 75.89/38.68 [2019-03-28 12:35:34,948 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8. Second operand 13 states. Result 107 states and 115 transitions. Complement of second has 77 states. 75.89/38.68 [2019-03-28 12:35:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 41 states 2 stem states 36 non-accepting loop states 3 accepting loop states 75.89/38.68 [2019-03-28 12:35:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 75.89/38.68 [2019-03-28 12:35:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 83 transitions. 75.89/38.68 [2019-03-28 12:35:34,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 83 transitions. Stem has 5 letters. Loop has 18 letters. 75.89/38.68 [2019-03-28 12:35:34,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.89/38.68 [2019-03-28 12:35:34,951 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted 75.89/38.68 [2019-03-28 12:35:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.89/38.68 [2019-03-28 12:35:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:34,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:34,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:34,990 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 75.89/38.68 [2019-03-28 12:35:34,990 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:34,995 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:34,996 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:34,996 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 75.89/38.68 [2019-03-28 12:35:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.89/38.68 [2019-03-28 12:35:35,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 75.89/38.68 [2019-03-28 12:35:35,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.89/38.68 [2019-03-28 12:35:35,167 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:35,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 88 75.89/38.68 [2019-03-28 12:35:35,171 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:35,210 INFO L497 ElimStorePlain]: treesize reduction 61, result has 43.5 percent of original size 75.89/38.68 [2019-03-28 12:35:35,211 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:35,211 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 75.89/38.68 [2019-03-28 12:35:35,265 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:35,265 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 75.89/38.68 [2019-03-28 12:35:35,266 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:35,288 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.89/38.68 [2019-03-28 12:35:35,288 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 75.89/38.68 [2019-03-28 12:35:35,289 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.89/38.68 [2019-03-28 12:35:35,371 INFO L497 ElimStorePlain]: treesize reduction 32, result has 80.8 percent of original size 75.89/38.68 [2019-03-28 12:35:35,371 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 75.89/38.68 [2019-03-28 12:35:35,372 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:121 75.89/38.68 [2019-03-28 12:35:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.89/38.68 [2019-03-28 12:35:35,484 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates 75.89/38.68 [2019-03-28 12:35:35,484 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8 Second operand 13 states. 75.89/38.68 [2019-03-28 12:35:35,688 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 30 transitions. cyclomatic complexity: 8. Second operand 13 states. Result 41 states and 49 transitions. Complement of second has 25 states. 75.89/38.68 [2019-03-28 12:35:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states 75.89/38.68 [2019-03-28 12:35:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 75.89/38.68 [2019-03-28 12:35:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. 75.89/38.68 [2019-03-28 12:35:35,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. 75.89/38.68 [2019-03-28 12:35:35,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.89/38.68 [2019-03-28 12:35:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. 75.89/38.68 [2019-03-28 12:35:35,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.89/38.68 [2019-03-28 12:35:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. 75.89/38.68 [2019-03-28 12:35:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.89/38.68 [2019-03-28 12:35:35,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. 75.89/38.68 [2019-03-28 12:35:35,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 75.89/38.68 [2019-03-28 12:35:35,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 75.89/38.68 [2019-03-28 12:35:35,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 75.89/38.68 [2019-03-28 12:35:35,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 75.89/38.68 [2019-03-28 12:35:35,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 75.89/38.68 [2019-03-28 12:35:35,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.89/38.68 [2019-03-28 12:35:35,697 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 75.89/38.68 [2019-03-28 12:35:35,697 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 75.89/38.68 [2019-03-28 12:35:35,697 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 75.89/38.68 [2019-03-28 12:35:35,697 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 75.89/38.68 [2019-03-28 12:35:35,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 75.89/38.68 [2019-03-28 12:35:35,698 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 75.89/38.68 [2019-03-28 12:35:35,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 75.89/38.68 [2019-03-28 12:35:35,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:35:35 BasicIcfg 75.89/38.68 [2019-03-28 12:35:35,706 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 75.89/38.68 [2019-03-28 12:35:35,707 INFO L168 Benchmark]: Toolchain (without parser) took 34410.87 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 493.9 MB). Free memory was 563.8 MB in the beginning and 817.6 MB in the end (delta: -253.9 MB). Peak memory consumption was 240.0 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,707 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.86 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 563.8 MB in the beginning and 654.5 MB in the end (delta: -90.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.04 ms. Allocated memory is still 689.4 MB. Free memory was 654.5 MB in the beginning and 651.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,708 INFO L168 Benchmark]: Boogie Preprocessor took 25.70 ms. Allocated memory is still 689.4 MB. Free memory was 651.3 MB in the beginning and 650.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,709 INFO L168 Benchmark]: RCFGBuilder took 423.87 ms. Allocated memory is still 689.4 MB. Free memory was 650.0 MB in the beginning and 620.6 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,709 INFO L168 Benchmark]: BlockEncodingV2 took 157.69 ms. Allocated memory is still 689.4 MB. Free memory was 620.6 MB in the beginning and 605.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,709 INFO L168 Benchmark]: TraceAbstraction took 1616.35 ms. Allocated memory is still 689.4 MB. Free memory was 605.8 MB in the beginning and 419.3 MB in the end (delta: 186.4 MB). Peak memory consumption was 186.4 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,709 INFO L168 Benchmark]: BuchiAutomizer took 31824.95 ms. Allocated memory was 689.4 MB in the beginning and 1.1 GB in the end (delta: 454.0 MB). Free memory was 418.0 MB in the beginning and 817.6 MB in the end (delta: -399.6 MB). Peak memory consumption was 54.4 MB. Max. memory is 50.3 GB. 75.89/38.68 [2019-03-28 12:35:35,712 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 75.89/38.68 --- Results --- 75.89/38.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 75.89/38.68 - StatisticsResult: Initial Icfg 75.89/38.68 77 locations, 81 edges 75.89/38.68 - StatisticsResult: Encoded RCFG 75.89/38.68 64 locations, 114 edges 75.89/38.68 * Results from de.uni_freiburg.informatik.ultimate.core: 75.89/38.68 - StatisticsResult: Toolchain Benchmarks 75.89/38.68 Benchmark results are: 75.89/38.68 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 75.89/38.68 * CACSL2BoogieTranslator took 311.86 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 563.8 MB in the beginning and 654.5 MB in the end (delta: -90.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 75.89/38.68 * Boogie Procedure Inliner took 45.04 ms. Allocated memory is still 689.4 MB. Free memory was 654.5 MB in the beginning and 651.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 75.89/38.68 * Boogie Preprocessor took 25.70 ms. Allocated memory is still 689.4 MB. Free memory was 651.3 MB in the beginning and 650.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 75.89/38.68 * RCFGBuilder took 423.87 ms. Allocated memory is still 689.4 MB. Free memory was 650.0 MB in the beginning and 620.6 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. 75.89/38.68 * BlockEncodingV2 took 157.69 ms. Allocated memory is still 689.4 MB. Free memory was 620.6 MB in the beginning and 605.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. 75.89/38.68 * TraceAbstraction took 1616.35 ms. Allocated memory is still 689.4 MB. Free memory was 605.8 MB in the beginning and 419.3 MB in the end (delta: 186.4 MB). Peak memory consumption was 186.4 MB. Max. memory is 50.3 GB. 75.89/38.68 * BuchiAutomizer took 31824.95 ms. Allocated memory was 689.4 MB in the beginning and 1.1 GB in the end (delta: 454.0 MB). Free memory was 418.0 MB in the beginning and 817.6 MB in the end (delta: -399.6 MB). Peak memory consumption was 54.4 MB. Max. memory is 50.3 GB. 75.89/38.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #length 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #length 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #length 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #length 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #length 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #length 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #memory_int 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #memory_int 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #memory_int 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #memory_int 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #memory_int 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #memory_int 75.89/38.68 - GenericResult: Unfinished Backtranslation 75.89/38.68 unknown boogie variable #memory_int 75.89/38.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 75.89/38.68 - PositiveResult [Line: 20]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 27]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 20]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 27]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 27]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 19]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 29]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 21]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 29]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 21]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 27]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 25]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 25]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 25]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 19]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 26]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 26]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 31]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 24]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 31]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 24]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 31]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 25]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 24]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 24]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 23]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 29]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 23]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 29]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 23]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 23]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 31]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 23]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 30]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 23]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - PositiveResult [Line: 30]: pointer dereference always succeeds 75.89/38.68 For all program executions holds that pointer dereference always succeeds at this location 75.89/38.68 - AllSpecificationsHoldResult: All specifications hold 75.89/38.68 36 specifications checked. All of them hold 75.89/38.68 - InvariantResult [Line: 23]: Loop Invariant 75.89/38.68 [2019-03-28 12:35:35,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.89/38.68 [2019-03-28 12:35:35,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.89/38.68 [2019-03-28 12:35:35,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.89/38.68 [2019-03-28 12:35:35,719 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.89/38.68 [2019-03-28 12:35:35,719 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.89/38.68 [2019-03-28 12:35:35,720 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 75.89/38.68 Derived loop invariant: (((((((z == 0 && \valid[y] == 1) && unknown-#length-unknown[z] == 4) && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && \valid[z] == 1) && 4 == unknown-#length-unknown[x]) && y == 0 75.89/38.68 - StatisticsResult: Ultimate Automizer benchmark data 75.89/38.68 CFG has 1 procedures, 64 locations, 36 error locations. SAFE Result, 1.5s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 401 SDslu, 4 SDs, 0 SdLazy, 414 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 75.89/38.68 - StatisticsResult: Constructed decomposition of program 75.89/38.68 Your program was decomposed into 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 32 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] and consists of 25 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] + -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] and consists of 14 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 75.89/38.68 - StatisticsResult: Timing statistics 75.89/38.68 BüchiAutomizer plugin needed 31.7s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 9.4s. Construction of modules took 1.8s. Büchi inclusion checks took 20.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 412 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 88 states and ocurred in iteration 4. Nontrivial modules had stage [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/44 HoareTripleCheckerStatistics: 173 SDtfs, 1358 SDslu, 1000 SDs, 0 SdLazy, 2528 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1454 mio100 ax100 hnf100 lsp97 ukn40 mio100 lsp39 div100 bol100 ite100 ukn100 eq177 hnf89 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 75.89/38.68 - TerminationAnalysisResult: Termination proven 75.89/38.68 Buchi Automizer proved that your program is terminating 75.89/38.68 RESULT: Ultimate proved your program to be correct! 75.89/38.68 !SESSION 2019-03-28 12:34:58.038 ----------------------------------------------- 75.89/38.68 eclipse.buildId=unknown 75.89/38.68 java.version=1.8.0_181 75.89/38.68 java.vendor=Oracle Corporation 75.89/38.68 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 75.89/38.68 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 75.89/38.68 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 75.89/38.68 75.89/38.68 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:35:35.947 75.89/38.68 !MESSAGE The workspace will exit with unsaved changes in this session. 75.89/38.68 Received shutdown request... 75.89/38.68 Ultimate: 75.89/38.68 GTK+ Version Check 75.89/38.68 EOF