279.15/248.72 YES 279.15/248.72 279.15/248.72 Ultimate: Cannot open display: 279.15/248.72 This is Ultimate 0.1.24-8dc7c08-m 279.15/248.72 [2019-03-28 12:40:46,404 INFO L170 SettingsManager]: Resetting all preferences to default values... 279.15/248.72 [2019-03-28 12:40:46,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 279.15/248.72 [2019-03-28 12:40:46,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 279.15/248.72 [2019-03-28 12:40:46,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 279.15/248.72 [2019-03-28 12:40:46,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 279.15/248.72 [2019-03-28 12:40:46,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 279.15/248.72 [2019-03-28 12:40:46,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 279.15/248.72 [2019-03-28 12:40:46,424 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 279.15/248.72 [2019-03-28 12:40:46,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 279.15/248.72 [2019-03-28 12:40:46,426 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 279.15/248.72 [2019-03-28 12:40:46,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 279.15/248.72 [2019-03-28 12:40:46,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 279.15/248.72 [2019-03-28 12:40:46,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 279.15/248.72 [2019-03-28 12:40:46,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 279.15/248.72 [2019-03-28 12:40:46,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 279.15/248.72 [2019-03-28 12:40:46,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 279.15/248.72 [2019-03-28 12:40:46,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 279.15/248.72 [2019-03-28 12:40:46,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 279.15/248.72 [2019-03-28 12:40:46,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 279.15/248.72 [2019-03-28 12:40:46,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 279.15/248.72 [2019-03-28 12:40:46,439 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 279.15/248.72 [2019-03-28 12:40:46,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 279.15/248.72 [2019-03-28 12:40:46,441 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 279.15/248.72 [2019-03-28 12:40:46,441 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 279.15/248.72 [2019-03-28 12:40:46,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 279.15/248.72 [2019-03-28 12:40:46,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 279.15/248.72 [2019-03-28 12:40:46,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 279.15/248.72 [2019-03-28 12:40:46,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 279.15/248.72 [2019-03-28 12:40:46,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 279.15/248.72 [2019-03-28 12:40:46,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 279.15/248.72 [2019-03-28 12:40:46,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 279.15/248.72 [2019-03-28 12:40:46,447 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 279.15/248.72 [2019-03-28 12:40:46,461 INFO L110 SettingsManager]: Loading preferences was successful 279.15/248.72 [2019-03-28 12:40:46,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 279.15/248.72 [2019-03-28 12:40:46,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 279.15/248.72 [2019-03-28 12:40:46,463 INFO L133 SettingsManager]: * Rewrite not-equals=true 279.15/248.72 [2019-03-28 12:40:46,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 279.15/248.72 [2019-03-28 12:40:46,463 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 279.15/248.72 [2019-03-28 12:40:46,463 INFO L133 SettingsManager]: * Use SBE=true 279.15/248.72 [2019-03-28 12:40:46,463 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 279.15/248.72 [2019-03-28 12:40:46,464 INFO L133 SettingsManager]: * Use old map elimination=false 279.15/248.72 [2019-03-28 12:40:46,464 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 279.15/248.72 [2019-03-28 12:40:46,464 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 279.15/248.72 [2019-03-28 12:40:46,464 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 279.15/248.72 [2019-03-28 12:40:46,464 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 279.15/248.72 [2019-03-28 12:40:46,464 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 279.15/248.72 [2019-03-28 12:40:46,465 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 279.15/248.72 [2019-03-28 12:40:46,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 279.15/248.72 [2019-03-28 12:40:46,465 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 279.15/248.72 [2019-03-28 12:40:46,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE 279.15/248.72 [2019-03-28 12:40:46,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 279.15/248.72 [2019-03-28 12:40:46,466 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 279.15/248.72 [2019-03-28 12:40:46,466 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 279.15/248.72 [2019-03-28 12:40:46,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 279.15/248.72 [2019-03-28 12:40:46,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 279.15/248.72 [2019-03-28 12:40:46,466 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 279.15/248.72 [2019-03-28 12:40:46,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 279.15/248.72 [2019-03-28 12:40:46,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 279.15/248.72 [2019-03-28 12:40:46,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 279.15/248.72 [2019-03-28 12:40:46,467 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 279.15/248.72 [2019-03-28 12:40:46,467 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 279.15/248.72 [2019-03-28 12:40:46,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 279.15/248.72 [2019-03-28 12:40:46,505 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 279.15/248.72 [2019-03-28 12:40:46,508 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 279.15/248.72 [2019-03-28 12:40:46,510 INFO L271 PluginConnector]: Initializing CDTParser... 279.15/248.72 [2019-03-28 12:40:46,510 INFO L276 PluginConnector]: CDTParser initialized 279.15/248.72 [2019-03-28 12:40:46,511 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 279.15/248.72 [2019-03-28 12:40:46,573 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/6c2c2f6a3f8c4a678c2e233be9bd3336/FLAGf296a7ba6 279.15/248.72 [2019-03-28 12:40:46,910 INFO L307 CDTParser]: Found 1 translation units. 279.15/248.72 [2019-03-28 12:40:46,911 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 279.15/248.72 [2019-03-28 12:40:46,911 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 279.15/248.72 [2019-03-28 12:40:46,918 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/6c2c2f6a3f8c4a678c2e233be9bd3336/FLAGf296a7ba6 279.15/248.72 [2019-03-28 12:40:47,318 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/6c2c2f6a3f8c4a678c2e233be9bd3336 279.15/248.72 [2019-03-28 12:40:47,330 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 279.15/248.72 [2019-03-28 12:40:47,331 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 279.15/248.72 [2019-03-28 12:40:47,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 279.15/248.72 [2019-03-28 12:40:47,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 279.15/248.72 [2019-03-28 12:40:47,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 279.15/248.72 [2019-03-28 12:40:47,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fcb49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:47,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 279.15/248.72 [2019-03-28 12:40:47,366 INFO L176 MainTranslator]: Built tables and reachable declarations 279.15/248.72 [2019-03-28 12:40:47,532 INFO L206 PostProcessor]: Analyzing one entry point: main 279.15/248.72 [2019-03-28 12:40:47,545 INFO L191 MainTranslator]: Completed pre-run 279.15/248.72 [2019-03-28 12:40:47,624 INFO L206 PostProcessor]: Analyzing one entry point: main 279.15/248.72 [2019-03-28 12:40:47,641 INFO L195 MainTranslator]: Completed translation 279.15/248.72 [2019-03-28 12:40:47,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47 WrapperNode 279.15/248.72 [2019-03-28 12:40:47,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 279.15/248.72 [2019-03-28 12:40:47,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 279.15/248.72 [2019-03-28 12:40:47,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 279.15/248.72 [2019-03-28 12:40:47,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 279.15/248.72 [2019-03-28 12:40:47,653 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:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,663 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:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 279.15/248.72 [2019-03-28 12:40:47,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 279.15/248.72 [2019-03-28 12:40:47,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 279.15/248.72 [2019-03-28 12:40:47,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized 279.15/248.72 [2019-03-28 12:40:47,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 [2019-03-28 12:40:47,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 279.15/248.72 [2019-03-28 12:40:47,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 279.15/248.72 [2019-03-28 12:40:47,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... 279.15/248.72 [2019-03-28 12:40:47,716 INFO L276 PluginConnector]: RCFGBuilder initialized 279.15/248.72 [2019-03-28 12:40:47,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 279.15/248.72 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 279.15/248.72 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 279.15/248.72 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 279.15/248.72 [2019-03-28 12:40:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 279.15/248.72 [2019-03-28 12:40:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 279.15/248.72 [2019-03-28 12:40:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 279.15/248.72 [2019-03-28 12:40:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 279.15/248.72 [2019-03-28 12:40:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 279.15/248.72 [2019-03-28 12:40:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 279.15/248.72 [2019-03-28 12:40:48,167 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 279.15/248.72 [2019-03-28 12:40:48,167 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 279.15/248.72 [2019-03-28 12:40:48,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:48 BoogieIcfgContainer 279.15/248.72 [2019-03-28 12:40:48,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 279.15/248.72 [2019-03-28 12:40:48,169 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 279.15/248.72 [2019-03-28 12:40:48,169 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 279.15/248.72 [2019-03-28 12:40:48,171 INFO L276 PluginConnector]: BlockEncodingV2 initialized 279.15/248.72 [2019-03-28 12:40:48,172 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:48" (1/1) ... 279.15/248.72 [2019-03-28 12:40:48,192 INFO L313 BlockEncoder]: Initial Icfg 73 locations, 77 edges 279.15/248.72 [2019-03-28 12:40:48,193 INFO L258 BlockEncoder]: Using Remove infeasible edges 279.15/248.72 [2019-03-28 12:40:48,194 INFO L263 BlockEncoder]: Using Maximize final states 279.15/248.72 [2019-03-28 12:40:48,195 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 279.15/248.72 [2019-03-28 12:40:48,195 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 279.15/248.72 [2019-03-28 12:40:48,197 INFO L296 BlockEncoder]: Using Remove sink states 279.15/248.72 [2019-03-28 12:40:48,198 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 279.15/248.72 [2019-03-28 12:40:48,198 INFO L179 BlockEncoder]: Using Rewrite not-equals 279.15/248.72 [2019-03-28 12:40:48,229 INFO L185 BlockEncoder]: Using Use SBE 279.15/248.72 [2019-03-28 12:40:48,277 INFO L200 BlockEncoder]: SBE split 41 edges 279.15/248.72 [2019-03-28 12:40:48,283 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 279.15/248.72 [2019-03-28 12:40:48,285 INFO L71 MaximizeFinalStates]: 0 new accepting states 279.15/248.72 [2019-03-28 12:40:48,316 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 279.15/248.72 [2019-03-28 12:40:48,319 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 279.15/248.72 [2019-03-28 12:40:48,321 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 279.15/248.72 [2019-03-28 12:40:48,321 INFO L71 MaximizeFinalStates]: 0 new accepting states 279.15/248.72 [2019-03-28 12:40:48,321 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 279.15/248.72 [2019-03-28 12:40:48,322 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 279.15/248.72 [2019-03-28 12:40:48,323 INFO L313 BlockEncoder]: Encoded RCFG 65 locations, 123 edges 279.15/248.72 [2019-03-28 12:40:48,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:48 BasicIcfg 279.15/248.72 [2019-03-28 12:40:48,323 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 279.15/248.72 [2019-03-28 12:40:48,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 279.15/248.72 [2019-03-28 12:40:48,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... 279.15/248.72 [2019-03-28 12:40:48,328 INFO L276 PluginConnector]: TraceAbstraction initialized 279.15/248.72 [2019-03-28 12:40:48,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:40:47" (1/4) ... 279.15/248.72 [2019-03-28 12:40:48,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3978994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:48, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:48,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (2/4) ... 279.15/248.72 [2019-03-28 12:40:48,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3978994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:48, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:48,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:48" (3/4) ... 279.15/248.72 [2019-03-28 12:40:48,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3978994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:48, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:48,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:48" (4/4) ... 279.15/248.72 [2019-03-28 12:40:48,332 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 279.15/248.72 [2019-03-28 12:40:48,342 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 279.15/248.72 [2019-03-28 12:40:48,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. 279.15/248.72 [2019-03-28 12:40:48,367 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. 279.15/248.72 [2019-03-28 12:40:48,396 INFO L133 ementStrategyFactory]: Using default assertion order modulation 279.15/248.72 [2019-03-28 12:40:48,397 INFO L382 AbstractCegarLoop]: Interprodecural is true 279.15/248.72 [2019-03-28 12:40:48,397 INFO L383 AbstractCegarLoop]: Hoare is true 279.15/248.72 [2019-03-28 12:40:48,397 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 279.15/248.72 [2019-03-28 12:40:48,397 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 279.15/248.72 [2019-03-28 12:40:48,397 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 279.15/248.72 [2019-03-28 12:40:48,397 INFO L387 AbstractCegarLoop]: Difference is false 279.15/248.72 [2019-03-28 12:40:48,398 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 279.15/248.72 [2019-03-28 12:40:48,398 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 279.15/248.72 [2019-03-28 12:40:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. 279.15/248.72 [2019-03-28 12:40:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 279.15/248.72 [2019-03-28 12:40:48,420 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:48,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 279.15/248.72 [2019-03-28 12:40:48,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash 167667, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:48,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:48,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:48,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:48,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:48,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:48,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:48,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:48,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:48,657 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:48,944 INFO L93 Difference]: Finished difference Result 65 states and 123 transitions. 279.15/248.72 [2019-03-28 12:40:48,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:48,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 279.15/248.72 [2019-03-28 12:40:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:48,961 INFO L225 Difference]: With dead ends: 65 279.15/248.72 [2019-03-28 12:40:48,961 INFO L226 Difference]: Without dead ends: 60 279.15/248.72 [2019-03-28 12:40:48,964 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 279.15/248.72 [2019-03-28 12:40:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. 279.15/248.72 [2019-03-28 12:40:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. 279.15/248.72 [2019-03-28 12:40:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 279.15/248.72 [2019-03-28 12:40:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 113 transitions. 279.15/248.72 [2019-03-28 12:40:49,007 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 113 transitions. Word has length 3 279.15/248.72 [2019-03-28 12:40:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:49,008 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 113 transitions. 279.15/248.72 [2019-03-28 12:40:49,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 113 transitions. 279.15/248.72 [2019-03-28 12:40:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 279.15/248.72 [2019-03-28 12:40:49,009 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:49,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 279.15/248.72 [2019-03-28 12:40:49,010 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 167669, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:49,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:49,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:49,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:49,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:49,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:49,042 INFO L87 Difference]: Start difference. First operand 60 states and 113 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:49,208 INFO L93 Difference]: Finished difference Result 65 states and 113 transitions. 279.15/248.72 [2019-03-28 12:40:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 279.15/248.72 [2019-03-28 12:40:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:49,210 INFO L225 Difference]: With dead ends: 65 279.15/248.72 [2019-03-28 12:40:49,210 INFO L226 Difference]: Without dead ends: 60 279.15/248.72 [2019-03-28 12:40:49,211 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 279.15/248.72 [2019-03-28 12:40:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. 279.15/248.72 [2019-03-28 12:40:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. 279.15/248.72 [2019-03-28 12:40:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 279.15/248.72 [2019-03-28 12:40:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 108 transitions. 279.15/248.72 [2019-03-28 12:40:49,219 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 108 transitions. Word has length 3 279.15/248.72 [2019-03-28 12:40:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:49,220 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 108 transitions. 279.15/248.72 [2019-03-28 12:40:49,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 108 transitions. 279.15/248.72 [2019-03-28 12:40:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 279.15/248.72 [2019-03-28 12:40:49,220 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:49,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 279.15/248.72 [2019-03-28 12:40:49,221 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash 167670, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:49,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:49,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:49,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:49,266 INFO L87 Difference]: Start difference. First operand 60 states and 108 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:49,493 INFO L93 Difference]: Finished difference Result 60 states and 108 transitions. 279.15/248.72 [2019-03-28 12:40:49,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 279.15/248.72 [2019-03-28 12:40:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:49,495 INFO L225 Difference]: With dead ends: 60 279.15/248.72 [2019-03-28 12:40:49,496 INFO L226 Difference]: Without dead ends: 55 279.15/248.72 [2019-03-28 12:40:49,496 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 279.15/248.72 [2019-03-28 12:40:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. 279.15/248.72 [2019-03-28 12:40:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. 279.15/248.72 [2019-03-28 12:40:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 279.15/248.72 [2019-03-28 12:40:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 103 transitions. 279.15/248.72 [2019-03-28 12:40:49,502 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 103 transitions. Word has length 3 279.15/248.72 [2019-03-28 12:40:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:49,503 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 103 transitions. 279.15/248.72 [2019-03-28 12:40:49,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 103 transitions. 279.15/248.72 [2019-03-28 12:40:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 279.15/248.72 [2019-03-28 12:40:49,503 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:49,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:49,504 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash 5194848, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:49,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:49,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:49,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:49,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:49,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:49,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:49,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:49,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:49,547 INFO L87 Difference]: Start difference. First operand 55 states and 103 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:49,716 INFO L93 Difference]: Finished difference Result 55 states and 103 transitions. 279.15/248.72 [2019-03-28 12:40:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 279.15/248.72 [2019-03-28 12:40:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:49,717 INFO L225 Difference]: With dead ends: 55 279.15/248.72 [2019-03-28 12:40:49,718 INFO L226 Difference]: Without dead ends: 50 279.15/248.72 [2019-03-28 12:40:49,718 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 279.15/248.72 [2019-03-28 12:40:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. 279.15/248.72 [2019-03-28 12:40:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. 279.15/248.72 [2019-03-28 12:40:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. 279.15/248.72 [2019-03-28 12:40:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. 279.15/248.72 [2019-03-28 12:40:49,724 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 4 279.15/248.72 [2019-03-28 12:40:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:49,724 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. 279.15/248.72 [2019-03-28 12:40:49,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. 279.15/248.72 [2019-03-28 12:40:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 279.15/248.72 [2019-03-28 12:40:49,725 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:49,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:49,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 5194850, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:49,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:49,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:49,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:49,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:49,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:49,774 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:49,913 INFO L93 Difference]: Finished difference Result 50 states and 93 transitions. 279.15/248.72 [2019-03-28 12:40:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 279.15/248.72 [2019-03-28 12:40:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:49,914 INFO L225 Difference]: With dead ends: 50 279.15/248.72 [2019-03-28 12:40:49,914 INFO L226 Difference]: Without dead ends: 45 279.15/248.72 [2019-03-28 12:40:49,915 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 279.15/248.72 [2019-03-28 12:40:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 279.15/248.72 [2019-03-28 12:40:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 279.15/248.72 [2019-03-28 12:40:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 279.15/248.72 [2019-03-28 12:40:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 83 transitions. 279.15/248.72 [2019-03-28 12:40:49,920 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 83 transitions. Word has length 4 279.15/248.72 [2019-03-28 12:40:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:49,921 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 83 transitions. 279.15/248.72 [2019-03-28 12:40:49,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. 279.15/248.72 [2019-03-28 12:40:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 279.15/248.72 [2019-03-28 12:40:49,921 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:49,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:49,922 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:49,923 INFO L82 PathProgramCache]: Analyzing trace with hash 161037122, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:49,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:49,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:49,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:49,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:49,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:49,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:49,963 INFO L87 Difference]: Start difference. First operand 45 states and 83 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:50,076 INFO L93 Difference]: Finished difference Result 45 states and 83 transitions. 279.15/248.72 [2019-03-28 12:40:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 279.15/248.72 [2019-03-28 12:40:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:50,078 INFO L225 Difference]: With dead ends: 45 279.15/248.72 [2019-03-28 12:40:50,078 INFO L226 Difference]: Without dead ends: 40 279.15/248.72 [2019-03-28 12:40:50,078 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 279.15/248.72 [2019-03-28 12:40:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 279.15/248.72 [2019-03-28 12:40:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 279.15/248.72 [2019-03-28 12:40:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 279.15/248.72 [2019-03-28 12:40:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. 279.15/248.72 [2019-03-28 12:40:50,083 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 5 279.15/248.72 [2019-03-28 12:40:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:50,083 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. 279.15/248.72 [2019-03-28 12:40:50,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. 279.15/248.72 [2019-03-28 12:40:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 279.15/248.72 [2019-03-28 12:40:50,084 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:50,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,084 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash 161037124, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:50,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:50,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:50,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:50,124 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:50,209 INFO L93 Difference]: Finished difference Result 45 states and 73 transitions. 279.15/248.72 [2019-03-28 12:40:50,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 279.15/248.72 [2019-03-28 12:40:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:50,210 INFO L225 Difference]: With dead ends: 45 279.15/248.72 [2019-03-28 12:40:50,210 INFO L226 Difference]: Without dead ends: 40 279.15/248.72 [2019-03-28 12:40:50,211 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 279.15/248.72 [2019-03-28 12:40:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 279.15/248.72 [2019-03-28 12:40:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 279.15/248.72 [2019-03-28 12:40:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 279.15/248.72 [2019-03-28 12:40:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 68 transitions. 279.15/248.72 [2019-03-28 12:40:50,215 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 68 transitions. Word has length 5 279.15/248.72 [2019-03-28 12:40:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 68 transitions. 279.15/248.72 [2019-03-28 12:40:50,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 68 transitions. 279.15/248.72 [2019-03-28 12:40:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 279.15/248.72 [2019-03-28 12:40:50,216 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:50,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,216 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:50,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 161037125, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:50,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:50,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:50,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:50,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:50,252 INFO L87 Difference]: Start difference. First operand 40 states and 68 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:50,359 INFO L93 Difference]: Finished difference Result 40 states and 68 transitions. 279.15/248.72 [2019-03-28 12:40:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 279.15/248.72 [2019-03-28 12:40:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:50,361 INFO L225 Difference]: With dead ends: 40 279.15/248.72 [2019-03-28 12:40:50,362 INFO L226 Difference]: Without dead ends: 35 279.15/248.72 [2019-03-28 12:40:50,362 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 279.15/248.72 [2019-03-28 12:40:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 279.15/248.72 [2019-03-28 12:40:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 279.15/248.72 [2019-03-28 12:40:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 279.15/248.72 [2019-03-28 12:40:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 63 transitions. 279.15/248.72 [2019-03-28 12:40:50,366 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 63 transitions. Word has length 5 279.15/248.72 [2019-03-28 12:40:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:50,366 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 63 transitions. 279.15/248.72 [2019-03-28 12:40:50,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 63 transitions. 279.15/248.72 [2019-03-28 12:40:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 279.15/248.72 [2019-03-28 12:40:50,367 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:50,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,367 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 697181161, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:50,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:50,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:50,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:50,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:50,395 INFO L87 Difference]: Start difference. First operand 35 states and 63 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:50,494 INFO L93 Difference]: Finished difference Result 35 states and 63 transitions. 279.15/248.72 [2019-03-28 12:40:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 279.15/248.72 [2019-03-28 12:40:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:50,495 INFO L225 Difference]: With dead ends: 35 279.15/248.72 [2019-03-28 12:40:50,495 INFO L226 Difference]: Without dead ends: 31 279.15/248.72 [2019-03-28 12:40:50,495 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 279.15/248.72 [2019-03-28 12:40:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 279.15/248.72 [2019-03-28 12:40:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 279.15/248.72 [2019-03-28 12:40:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 279.15/248.72 [2019-03-28 12:40:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. 279.15/248.72 [2019-03-28 12:40:50,499 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 55 transitions. Word has length 6 279.15/248.72 [2019-03-28 12:40:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:50,499 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 55 transitions. 279.15/248.72 [2019-03-28 12:40:50,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. 279.15/248.72 [2019-03-28 12:40:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 279.15/248.72 [2019-03-28 12:40:50,500 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:50,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,500 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash 697181163, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:50,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:50,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:50,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:50,525 INFO L87 Difference]: Start difference. First operand 31 states and 55 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:50,593 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. 279.15/248.72 [2019-03-28 12:40:50,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 279.15/248.72 [2019-03-28 12:40:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:50,594 INFO L225 Difference]: With dead ends: 35 279.15/248.72 [2019-03-28 12:40:50,594 INFO L226 Difference]: Without dead ends: 31 279.15/248.72 [2019-03-28 12:40:50,595 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 279.15/248.72 [2019-03-28 12:40:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 279.15/248.72 [2019-03-28 12:40:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 279.15/248.72 [2019-03-28 12:40:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 279.15/248.72 [2019-03-28 12:40:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. 279.15/248.72 [2019-03-28 12:40:50,598 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 6 279.15/248.72 [2019-03-28 12:40:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:50,598 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. 279.15/248.72 [2019-03-28 12:40:50,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. 279.15/248.72 [2019-03-28 12:40:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 279.15/248.72 [2019-03-28 12:40:50,599 INFO L394 BasicCegarLoop]: Found error trace 279.15/248.72 [2019-03-28 12:40:50,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,599 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== 279.15/248.72 [2019-03-28 12:40:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash 697181164, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:50,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:40:50,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.15/248.72 [2019-03-28 12:40:50,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.15/248.72 [2019-03-28 12:40:50,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:40:50,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:40:50,634 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 3 states. 279.15/248.72 [2019-03-28 12:40:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:40:50,724 INFO L93 Difference]: Finished difference Result 31 states and 51 transitions. 279.15/248.72 [2019-03-28 12:40:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 279.15/248.72 [2019-03-28 12:40:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.15/248.72 [2019-03-28 12:40:50,725 INFO L225 Difference]: With dead ends: 31 279.15/248.72 [2019-03-28 12:40:50,725 INFO L226 Difference]: Without dead ends: 0 279.15/248.72 [2019-03-28 12:40:50,726 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 279.15/248.72 [2019-03-28 12:40:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 279.15/248.72 [2019-03-28 12:40:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 279.15/248.72 [2019-03-28 12:40:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 279.15/248.72 [2019-03-28 12:40:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 279.15/248.72 [2019-03-28 12:40:50,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 279.15/248.72 [2019-03-28 12:40:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. 279.15/248.72 [2019-03-28 12:40:50,727 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 279.15/248.72 [2019-03-28 12:40:50,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:40:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 279.15/248.72 [2019-03-28 12:40:50,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 279.15/248.72 [2019-03-28 12:40:50,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 279.15/248.72 [2019-03-28 12:40:50,769 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,769 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,769 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,769 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,769 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 23) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,770 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 16 24) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,771 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,772 INFO L448 ceAbstractionStarter]: For program point L15-6(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,772 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 15 26) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,773 INFO L444 ceAbstractionStarter]: At program point L15-9(lines 14 26) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 279.15/248.72 [2019-03-28 12:40:50,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,773 INFO L448 ceAbstractionStarter]: For program point L15-10(lines 15 26) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,773 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 24) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,775 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 279.15/248.72 [2019-03-28 12:40:50,777 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 279.15/248.72 [2019-03-28 12:40:50,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.72 [2019-03-28 12:40:50,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:50 BasicIcfg 279.15/248.72 [2019-03-28 12:40:50,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 279.15/248.72 [2019-03-28 12:40:50,799 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 279.15/248.72 [2019-03-28 12:40:50,799 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 279.15/248.72 [2019-03-28 12:40:50,803 INFO L276 PluginConnector]: BuchiAutomizer initialized 279.15/248.72 [2019-03-28 12:40:50,803 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.15/248.72 [2019-03-28 12:40:50,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:40:47" (1/5) ... 279.15/248.72 [2019-03-28 12:40:50,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b70ddef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:50, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:50,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.15/248.72 [2019-03-28 12:40:50,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (2/5) ... 279.15/248.72 [2019-03-28 12:40:50,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b70ddef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:50, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:50,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.15/248.72 [2019-03-28 12:40:50,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:48" (3/5) ... 279.15/248.72 [2019-03-28 12:40:50,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b70ddef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:50, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:50,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.15/248.72 [2019-03-28 12:40:50,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:48" (4/5) ... 279.15/248.72 [2019-03-28 12:40:50,806 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b70ddef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:50, skipping insertion in model container 279.15/248.72 [2019-03-28 12:40:50,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.15/248.72 [2019-03-28 12:40:50,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:50" (5/5) ... 279.15/248.72 [2019-03-28 12:40:50,808 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 279.15/248.72 [2019-03-28 12:40:50,831 INFO L133 ementStrategyFactory]: Using default assertion order modulation 279.15/248.72 [2019-03-28 12:40:50,831 INFO L374 BuchiCegarLoop]: Interprodecural is true 279.15/248.72 [2019-03-28 12:40:50,831 INFO L375 BuchiCegarLoop]: Hoare is true 279.15/248.72 [2019-03-28 12:40:50,831 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 279.15/248.72 [2019-03-28 12:40:50,831 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 279.15/248.72 [2019-03-28 12:40:50,831 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 279.15/248.72 [2019-03-28 12:40:50,832 INFO L379 BuchiCegarLoop]: Difference is false 279.15/248.72 [2019-03-28 12:40:50,832 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 279.15/248.72 [2019-03-28 12:40:50,832 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 279.15/248.72 [2019-03-28 12:40:50,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. 279.15/248.72 [2019-03-28 12:40:50,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 279.15/248.72 [2019-03-28 12:40:50,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.72 [2019-03-28 12:40:50,842 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.72 [2019-03-28 12:40:50,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,848 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 279.15/248.72 [2019-03-28 12:40:50,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. 279.15/248.72 [2019-03-28 12:40:50,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 279.15/248.72 [2019-03-28 12:40:50,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.72 [2019-03-28 12:40:50,851 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.72 [2019-03-28 12:40:50,852 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,852 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:40:50,858 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue [136] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [223] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet19_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 33#L11true [137] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 29#L11-1true [130] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 52#L12true [161] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 65#L13true [174] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 7#L15-9true 279.15/248.72 [2019-03-28 12:40:50,858 INFO L796 eck$LassoCheckResult]: Loop: 7#L15-9true [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 20#L15true [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 39#L15-1true [264] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 38#L15-2true [143] L15-2-->L15-7: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 9#L15-7true [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 41#L16true [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 40#L16-1true [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 53#L16-2true [164] L16-2-->L17: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 61#L17true [170] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 57#L17-1true [320] L17-1-->L19-4: Formula: (and (= (select |v_#valid_59| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_31|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_48|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_48|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 22#L19-4true [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 19#L25true [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 7#L15-9true 279.15/248.72 [2019-03-28 12:40:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 696257566, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:40:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:40:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 413672848, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:40:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:40:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash 726527533, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:40:50,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:40:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:40:50,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:40:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:40:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:40:51,137 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 279.15/248.72 [2019-03-28 12:40:51,783 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 279.15/248.72 [2019-03-28 12:40:52,005 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 104 279.15/248.72 [2019-03-28 12:40:52,019 INFO L216 LassoAnalysis]: Preferences: 279.15/248.72 [2019-03-28 12:40:52,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 279.15/248.72 [2019-03-28 12:40:52,021 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 279.15/248.72 [2019-03-28 12:40:52,021 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 279.15/248.72 [2019-03-28 12:40:52,021 INFO L127 ssoRankerPreferences]: Use exernal solver: false 279.15/248.72 [2019-03-28 12:40:52,021 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 279.15/248.72 [2019-03-28 12:40:52,021 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 279.15/248.72 [2019-03-28 12:40:52,022 INFO L130 ssoRankerPreferences]: Path of dumped script: 279.15/248.72 [2019-03-28 12:40:52,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 279.15/248.72 [2019-03-28 12:40:52,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 279.15/248.72 [2019-03-28 12:40:52,022 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 279.15/248.72 [2019-03-28 12:40:52,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,588 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 279.15/248.72 [2019-03-28 12:40:52,715 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 279.15/248.72 [2019-03-28 12:40:52,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:40:52,999 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 279.15/248.72 [2019-03-28 12:40:53,346 INFO L300 LassoAnalysis]: Preprocessing complete. 279.15/248.72 [2019-03-28 12:40:53,352 INFO L497 LassoAnalysis]: Using template 'affine'. 279.15/248.72 [2019-03-28 12:40:53,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:40:53,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:40:53,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:40:53,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:40:53,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:40:53,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:40:53,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:40:53,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:40:53,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:40:53,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:40:53,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:40:53,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:40:53,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:40:53,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:40:53,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:40:53,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:40:53,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:40:53,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:40:53,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:40:53,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:40:53,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:40:53,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:40:53,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:40:53,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:40:53,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.72 [2019-03-28 12:40:53,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:40:53,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:40:53,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:40:53,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:40:53,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:40:53,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:40:53,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:40:53,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.72 [2019-03-28 12:40:53,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:40:53,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:40:53,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:40:53,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:40:53,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:40:53,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:40:53,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:40:53,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.72 [2019-03-28 12:40:53,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:40:53,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:40:53,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:40:53,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:40:53,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:40:53,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:40:53,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:40:53,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.72 [2019-03-28 12:40:53,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:40:53,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:40:53,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:40:53,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:40:53,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:40:53,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:40:53,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:40:53,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.72 [2019-03-28 12:40:53,424 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 279.15/248.72 [2019-03-28 12:40:53,439 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 279.15/248.72 [2019-03-28 12:40:53,440 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 279.15/248.72 [2019-03-28 12:40:53,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 279.15/248.72 [2019-03-28 12:40:53,444 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 279.15/248.72 [2019-03-28 12:40:53,444 INFO L518 LassoAnalysis]: Proved termination. 279.15/248.72 [2019-03-28 12:40:53,445 INFO L520 LassoAnalysis]: Termination argument consisting of: 279.15/248.72 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 279.15/248.72 Supporting invariants [] 279.15/248.72 [2019-03-28 12:40:53,616 INFO L297 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed 279.15/248.72 [2019-03-28 12:40:53,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.15/248.72 [2019-03-28 12:40:53,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.15/248.72 [2019-03-28 12:40:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:40:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:53,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core 279.15/248.72 [2019-03-28 12:40:53,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.72 [2019-03-28 12:40:53,725 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:40:53,726 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 279.15/248.72 [2019-03-28 12:40:53,727 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:53,740 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:40:53,741 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:53,741 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:6 279.15/248.72 [2019-03-28 12:40:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:53,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 279.15/248.72 [2019-03-28 12:40:53,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.72 [2019-03-28 12:40:53,887 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:40:53,888 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.72 [2019-03-28 12:40:53,895 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:53,936 INFO L497 ElimStorePlain]: treesize reduction 26, result has 56.7 percent of original size 279.15/248.72 [2019-03-28 12:40:53,937 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:53,937 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 279.15/248.72 [2019-03-28 12:40:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:40:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:40:54,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 279.15/248.72 [2019-03-28 12:40:54,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.72 [2019-03-28 12:40:54,249 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:40:54,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.72 [2019-03-28 12:40:54,257 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:54,290 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 279.15/248.72 [2019-03-28 12:40:54,291 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:54,291 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 279.15/248.72 [2019-03-28 12:40:54,340 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:40:54,341 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 47 treesize of output 83 279.15/248.72 [2019-03-28 12:40:54,347 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:54,395 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:40:54,395 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 47 treesize of output 83 279.15/248.72 [2019-03-28 12:40:54,401 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:40:54,492 INFO L497 ElimStorePlain]: treesize reduction 70, result has 64.8 percent of original size 279.15/248.72 [2019-03-28 12:40:54,494 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.72 [2019-03-28 12:40:54,494 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:113 279.15/248.72 [2019-03-28 12:41:06,630 WARN L188 SmtUtils]: Spent 11.14 s on a formula simplification. DAG size of input: 47 DAG size of output: 25 279.15/248.72 [2019-03-28 12:41:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:41:06,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 279.15/248.72 [2019-03-28 12:41:06,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.72 [2019-03-28 12:41:06,750 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:41:06,750 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 279.15/248.72 [2019-03-28 12:41:06,755 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:06,800 INFO L497 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size 279.15/248.72 [2019-03-28 12:41:06,801 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:06,802 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 279.15/248.72 [2019-03-28 12:41:06,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 279.15/248.72 [2019-03-28 12:41:06,892 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:06,930 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:41:06,930 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 40 treesize of output 88 279.15/248.72 [2019-03-28 12:41:06,943 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:07,035 INFO L497 ElimStorePlain]: treesize reduction 85, result has 48.8 percent of original size 279.15/248.72 [2019-03-28 12:41:07,037 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 279.15/248.72 [2019-03-28 12:41:07,037 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 279.15/248.72 [2019-03-28 12:41:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:41:12,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 279.15/248.72 [2019-03-28 12:41:12,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.72 [2019-03-28 12:41:12,084 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:41:12,085 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 279.15/248.72 [2019-03-28 12:41:12,090 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:12,133 INFO L497 ElimStorePlain]: treesize reduction 47, result has 42.0 percent of original size 279.15/248.72 [2019-03-28 12:41:12,134 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:12,135 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 279.15/248.72 [2019-03-28 12:41:12,183 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:41:12,183 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 40 treesize of output 88 279.15/248.72 [2019-03-28 12:41:12,194 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:12,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 279.15/248.72 [2019-03-28 12:41:12,205 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:12,293 INFO L497 ElimStorePlain]: treesize reduction 98, result has 45.3 percent of original size 279.15/248.72 [2019-03-28 12:41:12,294 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 279.15/248.72 [2019-03-28 12:41:12,294 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 279.15/248.72 [2019-03-28 12:41:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:12,310 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.15/248.72 [2019-03-28 12:41:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:41:12,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 279.15/248.72 [2019-03-28 12:41:12,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.72 [2019-03-28 12:41:12,397 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.72 [2019-03-28 12:41:12,397 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 34 treesize of output 82 279.15/248.72 [2019-03-28 12:41:12,406 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:12,463 INFO L497 ElimStorePlain]: treesize reduction 96, result has 35.6 percent of original size 279.15/248.72 [2019-03-28 12:41:12,464 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.15/248.72 [2019-03-28 12:41:12,465 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 279.15/248.72 [2019-03-28 12:41:24,511 WARN L188 SmtUtils]: Spent 3.62 s on a formula simplification that was a NOOP. DAG size: 31 279.15/248.72 [2019-03-28 12:41:25,455 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.72 [2019-03-28 12:41:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:25,502 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.15/248.72 [2019-03-28 12:41:25,502 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 19 predicates after loop cannibalization 279.15/248.72 [2019-03-28 12:41:25,507 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 19 loop predicates 279.15/248.72 [2019-03-28 12:41:25,508 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 65 states. Second operand 9 states. 279.15/248.72 [2019-03-28 12:41:44,114 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 65 states.. Second operand 9 states. Result 826 states and 1422 transitions. Complement of second has 112 states. 279.15/248.72 [2019-03-28 12:41:44,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 58 states 2 stem states 54 non-accepting loop states 2 accepting loop states 279.15/248.72 [2019-03-28 12:41:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 279.15/248.72 [2019-03-28 12:41:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 812 transitions. 279.15/248.72 [2019-03-28 12:41:44,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 812 transitions. Stem has 6 letters. Loop has 12 letters. 279.15/248.72 [2019-03-28 12:41:44,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.15/248.72 [2019-03-28 12:41:44,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 812 transitions. Stem has 18 letters. Loop has 12 letters. 279.15/248.72 [2019-03-28 12:41:44,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.15/248.72 [2019-03-28 12:41:44,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 812 transitions. Stem has 6 letters. Loop has 24 letters. 279.15/248.72 [2019-03-28 12:41:44,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.15/248.72 [2019-03-28 12:41:44,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1422 transitions. 279.15/248.72 [2019-03-28 12:41:44,160 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 149 279.15/248.72 [2019-03-28 12:41:44,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 230 states and 300 transitions. 279.15/248.72 [2019-03-28 12:41:44,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 279.15/248.72 [2019-03-28 12:41:44,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 279.15/248.72 [2019-03-28 12:41:44,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 300 transitions. 279.15/248.72 [2019-03-28 12:41:44,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.15/248.72 [2019-03-28 12:41:44,167 INFO L706 BuchiCegarLoop]: Abstraction has 230 states and 300 transitions. 279.15/248.72 [2019-03-28 12:41:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 300 transitions. 279.15/248.72 [2019-03-28 12:41:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 62. 279.15/248.72 [2019-03-28 12:41:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 279.15/248.72 [2019-03-28 12:41:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. 279.15/248.72 [2019-03-28 12:41:44,173 INFO L729 BuchiCegarLoop]: Abstraction has 62 states and 92 transitions. 279.15/248.72 [2019-03-28 12:41:44,173 INFO L609 BuchiCegarLoop]: Abstraction has 62 states and 92 transitions. 279.15/248.72 [2019-03-28 12:41:44,173 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 279.15/248.72 [2019-03-28 12:41:44,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 92 transitions. 279.15/248.72 [2019-03-28 12:41:44,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 279.15/248.72 [2019-03-28 12:41:44,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.72 [2019-03-28 12:41:44,174 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.72 [2019-03-28 12:41:44,175 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:44,175 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:44,176 INFO L794 eck$LassoCheckResult]: Stem: 1556#ULTIMATE.startENTRY [136] 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] 1531#L-1 [223] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet19_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1532#L11 [137] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1555#L11-1 [130] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1533#L12 [161] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1534#L13 [174] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1561#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1562#L15 279.15/248.72 [2019-03-28 12:41:44,176 INFO L796 eck$LassoCheckResult]: Loop: 1562#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1570#L15-1 [264] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1567#L15-2 [143] L15-2-->L15-7: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 1565#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 1564#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1563#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1535#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1536#L19 [127] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1575#L19-1 [124] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_32| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 1574#L19-2 [211] L19-2-->L19-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem13_6| |v_ULTIMATE.start_test_fun_#t~mem12_6|) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13] 1573#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1572#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1571#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1562#L15 279.15/248.72 [2019-03-28 12:41:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash 109148170, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:44,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:44,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:44,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash -616110684, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:44,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:44,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:44,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:44,224 INFO L82 PathProgramCache]: Analyzing trace with hash 364151867, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:44,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:44,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:44,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:41:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:41:44,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:41:44,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 279.15/248.72 [2019-03-28 12:41:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 279.15/248.72 [2019-03-28 12:41:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 279.15/248.72 [2019-03-28 12:41:44,433 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. cyclomatic complexity: 33 Second operand 7 states. 279.15/248.72 [2019-03-28 12:41:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:41:44,670 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. 279.15/248.72 [2019-03-28 12:41:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 279.15/248.72 [2019-03-28 12:41:44,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 125 transitions. 279.15/248.72 [2019-03-28 12:41:44,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 279.15/248.72 [2019-03-28 12:41:44,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 82 states and 115 transitions. 279.15/248.72 [2019-03-28 12:41:44,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 279.15/248.72 [2019-03-28 12:41:44,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 279.15/248.72 [2019-03-28 12:41:44,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 115 transitions. 279.15/248.72 [2019-03-28 12:41:44,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.15/248.72 [2019-03-28 12:41:44,692 INFO L706 BuchiCegarLoop]: Abstraction has 82 states and 115 transitions. 279.15/248.72 [2019-03-28 12:41:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 115 transitions. 279.15/248.72 [2019-03-28 12:41:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. 279.15/248.72 [2019-03-28 12:41:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. 279.15/248.72 [2019-03-28 12:41:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. 279.15/248.72 [2019-03-28 12:41:44,696 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 111 transitions. 279.15/248.72 [2019-03-28 12:41:44,696 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 111 transitions. 279.15/248.72 [2019-03-28 12:41:44,696 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 279.15/248.72 [2019-03-28 12:41:44,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 111 transitions. 279.15/248.72 [2019-03-28 12:41:44,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 279.15/248.72 [2019-03-28 12:41:44,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.72 [2019-03-28 12:41:44,697 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.72 [2019-03-28 12:41:44,698 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:44,698 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:44,699 INFO L794 eck$LassoCheckResult]: Stem: 1729#ULTIMATE.startENTRY [136] 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] 1703#L-1 [223] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet19_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1704#L11 [137] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1728#L11-1 [130] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1705#L12 [161] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1706#L13 [174] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1734#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1742#L15 279.15/248.72 [2019-03-28 12:41:44,700 INFO L796 eck$LassoCheckResult]: Loop: 1742#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1739#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1735#L15-2 [143] L15-2-->L15-7: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 1699#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 1760#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1759#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1758#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1757#L19 [127] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1756#L19-1 [124] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_32| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 1755#L19-2 [211] L19-2-->L19-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem13_6| |v_ULTIMATE.start_test_fun_#t~mem12_6|) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13] 1714#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1715#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1754#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1742#L15 279.15/248.72 [2019-03-28 12:41:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash 109148170, now seen corresponding path program 2 times 279.15/248.72 [2019-03-28 12:41:44,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash -487027965, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:44,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:44,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:44,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:41:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:41:44,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:41:44,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 279.15/248.72 [2019-03-28 12:41:44,738 INFO L811 eck$LassoCheckResult]: loop already infeasible 279.15/248.72 [2019-03-28 12:41:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.15/248.72 [2019-03-28 12:41:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.15/248.72 [2019-03-28 12:41:44,739 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. cyclomatic complexity: 36 Second operand 3 states. 279.15/248.72 [2019-03-28 12:41:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:41:44,833 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. 279.15/248.72 [2019-03-28 12:41:44,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.15/248.72 [2019-03-28 12:41:44,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 108 transitions. 279.15/248.72 [2019-03-28 12:41:44,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 279.15/248.72 [2019-03-28 12:41:44,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 279.15/248.72 [2019-03-28 12:41:44,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 279.15/248.72 [2019-03-28 12:41:44,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.15/248.72 [2019-03-28 12:41:44,850 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. 279.15/248.72 [2019-03-28 12:41:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. 279.15/248.72 [2019-03-28 12:41:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,853 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,853 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,854 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 279.15/248.72 [2019-03-28 12:41:44,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 103 transitions. 279.15/248.72 [2019-03-28 12:41:44,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 279.15/248.72 [2019-03-28 12:41:44,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.72 [2019-03-28 12:41:44,855 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.72 [2019-03-28 12:41:44,855 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:44,855 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:44,856 INFO L794 eck$LassoCheckResult]: Stem: 1896#ULTIMATE.startENTRY [136] 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] 1870#L-1 [223] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet19_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1871#L11 [137] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1895#L11-1 [130] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1872#L12 [161] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1873#L13 [174] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1903#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1907#L15 279.15/248.72 [2019-03-28 12:41:44,856 INFO L796 eck$LassoCheckResult]: Loop: 1907#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1918#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1917#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 1916#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1915#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1914#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1913#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 1912#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1911#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1874#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1875#L19 [127] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1889#L19-1 [124] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_32| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 1886#L19-2 [211] L19-2-->L19-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem13_6| |v_ULTIMATE.start_test_fun_#t~mem12_6|) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13] 1887#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1920#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1919#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1907#L15 279.15/248.72 [2019-03-28 12:41:44,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 109148170, now seen corresponding path program 3 times 279.15/248.72 [2019-03-28 12:41:44,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -711199471, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:44,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:44,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.72 [2019-03-28 12:41:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.72 [2019-03-28 12:41:44,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.72 [2019-03-28 12:41:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 279.15/248.72 [2019-03-28 12:41:44,953 INFO L811 eck$LassoCheckResult]: loop already infeasible 279.15/248.72 [2019-03-28 12:41:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 279.15/248.72 [2019-03-28 12:41:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 279.15/248.72 [2019-03-28 12:41:44,954 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. cyclomatic complexity: 28 Second operand 8 states. 279.15/248.72 [2019-03-28 12:41:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.72 [2019-03-28 12:41:45,243 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. 279.15/248.72 [2019-03-28 12:41:45,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 279.15/248.72 [2019-03-28 12:41:45,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 110 transitions. 279.15/248.72 [2019-03-28 12:41:45,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 279.15/248.72 [2019-03-28 12:41:45,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 85 states and 107 transitions. 279.15/248.72 [2019-03-28 12:41:45,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 279.15/248.72 [2019-03-28 12:41:45,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 279.15/248.72 [2019-03-28 12:41:45,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 107 transitions. 279.15/248.72 [2019-03-28 12:41:45,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.15/248.72 [2019-03-28 12:41:45,260 INFO L706 BuchiCegarLoop]: Abstraction has 85 states and 107 transitions. 279.15/248.72 [2019-03-28 12:41:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 107 transitions. 279.15/248.72 [2019-03-28 12:41:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. 279.15/248.72 [2019-03-28 12:41:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. 279.15/248.72 [2019-03-28 12:41:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. 279.15/248.72 [2019-03-28 12:41:45,263 INFO L729 BuchiCegarLoop]: Abstraction has 63 states and 85 transitions. 279.15/248.72 [2019-03-28 12:41:45,263 INFO L609 BuchiCegarLoop]: Abstraction has 63 states and 85 transitions. 279.15/248.72 [2019-03-28 12:41:45,263 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 279.15/248.72 [2019-03-28 12:41:45,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 85 transitions. 279.15/248.72 [2019-03-28 12:41:45,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 279.15/248.72 [2019-03-28 12:41:45,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.72 [2019-03-28 12:41:45,264 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.72 [2019-03-28 12:41:45,265 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:45,265 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.72 [2019-03-28 12:41:45,266 INFO L794 eck$LassoCheckResult]: Stem: 2077#ULTIMATE.startENTRY [136] 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] 2055#L-1 [223] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet19_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2056#L11 [137] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2073#L11-1 [130] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2057#L12 [161] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2058#L13 [174] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 2081#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2087#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 2084#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 2085#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 2100#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2074#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 2075#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 2099#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 2098#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2097#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2059#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2060#L19 279.15/248.72 [2019-03-28 12:41:45,266 INFO L796 eck$LassoCheckResult]: Loop: 2060#L19 [127] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2072#L19-1 [124] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_32| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2071#L19-2 [122] L19-2-->L20: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem13_4| |v_ULTIMATE.start_test_fun_#t~mem12_4|) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_4|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_4|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_3|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13] 2054#L20 [158] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_36|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_20|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14] 2050#L20-1 [322] L20-1-->L19-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= (store |v_#memory_int_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_35|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 2051#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 2062#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 2044#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2045#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 2064#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 2095#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 2094#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2093#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 2092#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 2091#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 2090#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2089#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2088#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2060#L19 279.15/248.72 [2019-03-28 12:41:45,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:45,267 INFO L82 PathProgramCache]: Analyzing trace with hash 425201394, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:45,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:45,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash -282681882, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:45,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:45,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:45,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.72 [2019-03-28 12:41:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1362965143, now seen corresponding path program 1 times 279.15/248.72 [2019-03-28 12:41:45,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.72 [2019-03-28 12:41:45,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.72 [2019-03-28 12:41:45,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.72 [2019-03-28 12:41:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.72 [2019-03-28 12:41:45,584 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 279.15/248.72 [2019-03-28 12:41:46,267 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 129 279.15/248.72 [2019-03-28 12:41:46,501 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 106 279.15/248.72 [2019-03-28 12:41:46,505 INFO L216 LassoAnalysis]: Preferences: 279.15/248.72 [2019-03-28 12:41:46,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 279.15/248.72 [2019-03-28 12:41:46,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 279.15/248.72 [2019-03-28 12:41:46,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 279.15/248.72 [2019-03-28 12:41:46,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false 279.15/248.72 [2019-03-28 12:41:46,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 279.15/248.72 [2019-03-28 12:41:46,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 279.15/248.72 [2019-03-28 12:41:46,506 INFO L130 ssoRankerPreferences]: Path of dumped script: 279.15/248.72 [2019-03-28 12:41:46,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 279.15/248.72 [2019-03-28 12:41:46,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 279.15/248.72 [2019-03-28 12:41:46,506 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 279.15/248.72 [2019-03-28 12:41:46,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:46,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.15/248.72 [2019-03-28 12:41:47,078 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 279.15/248.72 [2019-03-28 12:41:47,258 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 279.15/248.72 [2019-03-28 12:41:47,813 INFO L300 LassoAnalysis]: Preprocessing complete. 279.15/248.72 [2019-03-28 12:41:47,813 INFO L497 LassoAnalysis]: Using template 'affine'. 279.15/248.72 [2019-03-28 12:41:47,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.72 Consider only non-deceasing supporting invariants: true 279.15/248.72 Simplify termination arguments: true 279.15/248.72 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.72 [2019-03-28 12:41:47,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.72 [2019-03-28 12:41:47,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.72 [2019-03-28 12:41:47,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.72 [2019-03-28 12:41:47,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.72 [2019-03-28 12:41:47,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.72 [2019-03-28 12:41:47,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.72 [2019-03-28 12:41:47,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.72 [2019-03-28 12:41:47,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.72 [2019-03-28 12:41:47,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.72 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.72 Number of strict supporting invariants: 0 279.15/248.72 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.73 [2019-03-28 12:41:47,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.73 [2019-03-28 12:41:47,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.73 [2019-03-28 12:41:47,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.73 [2019-03-28 12:41:47,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.73 [2019-03-28 12:41:47,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.15/248.73 [2019-03-28 12:41:47,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.15/248.73 [2019-03-28 12:41:47,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.15/248.73 Termination analysis: LINEAR_WITH_GUESSES 279.15/248.73 Number of strict supporting invariants: 0 279.15/248.73 Number of non-strict supporting invariants: 1 279.15/248.73 Consider only non-deceasing supporting invariants: true 279.15/248.73 Simplify termination arguments: true 279.15/248.73 Simplify supporting invariants: trueOverapproximate stem: false 279.15/248.73 [2019-03-28 12:41:47,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.15/248.73 [2019-03-28 12:41:47,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.15/248.73 [2019-03-28 12:41:47,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.15/248.73 [2019-03-28 12:41:47,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.15/248.73 [2019-03-28 12:41:47,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.15/248.73 [2019-03-28 12:41:47,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.15/248.73 [2019-03-28 12:41:47,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 279.15/248.73 [2019-03-28 12:41:47,932 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 279.15/248.73 [2019-03-28 12:41:47,933 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. 279.15/248.73 [2019-03-28 12:41:47,933 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 279.15/248.73 [2019-03-28 12:41:47,934 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 279.15/248.73 [2019-03-28 12:41:47,935 INFO L518 LassoAnalysis]: Proved termination. 279.15/248.73 [2019-03-28 12:41:47,935 INFO L520 LassoAnalysis]: Termination argument consisting of: 279.15/248.73 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 279.15/248.73 Supporting invariants [] 279.15/248.73 [2019-03-28 12:41:48,116 INFO L297 tatePredicateManager]: 40 out of 42 supporting invariants were superfluous and have been removed 279.15/248.73 [2019-03-28 12:41:48,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.15/248.73 [2019-03-28 12:41:48,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.15/248.73 [2019-03-28 12:41:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.73 [2019-03-28 12:41:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:41:48,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:41:48,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:41:48,181 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:41:48,182 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 31 treesize of output 35 279.15/248.73 [2019-03-28 12:41:48,182 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:48,192 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:41:48,193 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:48,193 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:9 279.15/248.73 [2019-03-28 12:41:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:41:48,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:41:48,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:41:48,335 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:41:48,335 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:41:48,338 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:48,377 INFO L497 ElimStorePlain]: treesize reduction 26, result has 58.7 percent of original size 279.15/248.73 [2019-03-28 12:41:48,378 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:48,378 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:41:48,479 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:41:48,479 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:41:48,483 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:48,516 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:41:48,517 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:41:48,521 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:48,642 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 279.15/248.73 [2019-03-28 12:41:48,643 INFO L497 ElimStorePlain]: treesize reduction 103, result has 53.0 percent of original size 279.15/248.73 [2019-03-28 12:41:48,644 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:41:48,644 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:98 279.15/248.73 [2019-03-28 12:41:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.73 [2019-03-28 12:41:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:41:52,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:41:52,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:41:52,690 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:41:52,691 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 279.15/248.73 [2019-03-28 12:41:52,694 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:52,739 INFO L497 ElimStorePlain]: treesize reduction 43, result has 46.9 percent of original size 279.15/248.73 [2019-03-28 12:41:52,740 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:52,740 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 279.15/248.73 [2019-03-28 12:41:52,821 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 37 treesize of output 29 279.15/248.73 [2019-03-28 12:41:52,821 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:52,855 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:41:52,855 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 43 treesize of output 91 279.15/248.73 [2019-03-28 12:41:52,863 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:41:52,973 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 279.15/248.73 [2019-03-28 12:41:52,973 INFO L497 ElimStorePlain]: treesize reduction 123, result has 41.4 percent of original size 279.15/248.73 [2019-03-28 12:41:52,974 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:41:52,975 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:70 279.15/248.73 [2019-03-28 12:42:00,449 WARN L188 SmtUtils]: Spent 3.67 s on a formula simplification that was a NOOP. DAG size: 41 279.15/248.73 [2019-03-28 12:42:03,518 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:42:04,463 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:42:05,514 WARN L860 $PredicateComparison]: unable to prove that (or (<= 0 c_oldRank0) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:42:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:42:05,621 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.15/248.73 [2019-03-28 12:42:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:42:05,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:42:05,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:42:05,713 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:05,714 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 34 treesize of output 82 279.15/248.73 [2019-03-28 12:42:05,720 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:05,777 INFO L497 ElimStorePlain]: treesize reduction 96, result has 36.8 percent of original size 279.15/248.73 [2019-03-28 12:42:05,778 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:05,778 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 279.15/248.73 [2019-03-28 12:42:16,060 WARN L188 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 33 279.15/248.73 [2019-03-28 12:42:18,973 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:42:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:42:19,061 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.15/248.73 [2019-03-28 12:42:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:42:19,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:42:19,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:42:19,109 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:19,110 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:42:19,114 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:19,152 INFO L497 ElimStorePlain]: treesize reduction 37, result has 50.7 percent of original size 279.15/248.73 [2019-03-28 12:42:19,153 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:19,153 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:42:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:42:19,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:42:19,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:42:19,195 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:19,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:42:19,198 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:19,228 INFO L497 ElimStorePlain]: treesize reduction 26, result has 58.7 percent of original size 279.15/248.73 [2019-03-28 12:42:19,228 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:19,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:42:19,269 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:19,270 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 86 279.15/248.73 [2019-03-28 12:42:19,273 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:19,303 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:19,303 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:42:19,306 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:19,410 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 279.15/248.73 [2019-03-28 12:42:19,410 INFO L497 ElimStorePlain]: treesize reduction 103, result has 53.0 percent of original size 279.15/248.73 [2019-03-28 12:42:19,411 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:42:19,411 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:98 279.15/248.73 [2019-03-28 12:42:31,096 WARN L188 SmtUtils]: Spent 4.99 s on a formula simplification that was a NOOP. DAG size: 47 279.15/248.73 [2019-03-28 12:42:32,072 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset))) (or (<= (+ .cse0 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))))) is different from true 279.15/248.73 [2019-03-28 12:42:33,419 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_3 c_ULTIMATE.start_test_fun_~z_ref~0.offset))))) is different from true 279.15/248.73 [2019-03-28 12:42:34,348 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset))) (or (<= (+ .cse0 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_3 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))))) is different from true 279.15/248.73 [2019-03-28 12:42:35,307 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:42:36,190 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base)) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_3 c_ULTIMATE.start_test_fun_~z_ref~0.offset))))) is different from true 279.15/248.73 [2019-03-28 12:42:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:42:36,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:42:36,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:42:36,240 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:36,241 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:42:36,243 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:36,276 INFO L497 ElimStorePlain]: treesize reduction 26, result has 58.7 percent of original size 279.15/248.73 [2019-03-28 12:42:36,277 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:36,277 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:42:36,322 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:36,322 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 86 279.15/248.73 [2019-03-28 12:42:36,325 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:36,354 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:36,354 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:42:36,357 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:36,471 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 279.15/248.73 [2019-03-28 12:42:36,472 INFO L497 ElimStorePlain]: treesize reduction 103, result has 53.0 percent of original size 279.15/248.73 [2019-03-28 12:42:36,473 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:42:36,473 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:98 279.15/248.73 [2019-03-28 12:42:51,460 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 47 279.15/248.73 [2019-03-28 12:42:52,430 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset))) (or (<= (+ .cse0 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)))) is different from true 279.15/248.73 [2019-03-28 12:42:53,314 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) is different from true 279.15/248.73 [2019-03-28 12:42:54,543 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:42:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:42:54,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:42:54,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:42:54,588 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:54,589 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:42:54,591 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:54,624 INFO L497 ElimStorePlain]: treesize reduction 26, result has 58.7 percent of original size 279.15/248.73 [2019-03-28 12:42:54,625 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:54,625 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:42:54,666 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:54,667 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:42:54,670 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:54,713 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:42:54,713 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:42:54,717 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:42:54,827 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 279.15/248.73 [2019-03-28 12:42:54,828 INFO L497 ElimStorePlain]: treesize reduction 70, result has 65.9 percent of original size 279.15/248.73 [2019-03-28 12:42:54,829 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:42:54,829 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:119 279.15/248.73 [2019-03-28 12:43:22,152 WARN L188 SmtUtils]: Spent 14.70 s on a formula simplification. DAG size of input: 49 DAG size of output: 42 279.15/248.73 [2019-03-28 12:43:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:43:22,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:43:22,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:43:22,267 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:43:22,268 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:43:22,271 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:22,309 INFO L497 ElimStorePlain]: treesize reduction 37, result has 50.7 percent of original size 279.15/248.73 [2019-03-28 12:43:22,310 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:22,310 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:43:22,352 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:43:22,353 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:43:22,356 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:22,385 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:43:22,386 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:43:22,389 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:22,499 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 279.15/248.73 [2019-03-28 12:43:22,500 INFO L497 ElimStorePlain]: treesize reduction 103, result has 53.0 percent of original size 279.15/248.73 [2019-03-28 12:43:22,501 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:43:22,501 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:98 279.15/248.73 [2019-03-28 12:43:40,908 WARN L188 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 279.15/248.73 [2019-03-28 12:43:41,808 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_6 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) is different from true 279.15/248.73 [2019-03-28 12:43:42,692 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:43:43,888 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_6 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 279.15/248.73 [2019-03-28 12:43:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:43:43,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:43:43,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:43:43,933 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:43:43,933 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:43:43,937 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:43,974 INFO L497 ElimStorePlain]: treesize reduction 37, result has 50.7 percent of original size 279.15/248.73 [2019-03-28 12:43:43,974 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:43,974 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:43:44,014 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:43:44,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 86 279.15/248.73 [2019-03-28 12:43:44,018 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:44,068 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:43:44,069 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:43:44,072 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:43:44,178 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 279.15/248.73 [2019-03-28 12:43:44,178 INFO L497 ElimStorePlain]: treesize reduction 70, result has 65.9 percent of original size 279.15/248.73 [2019-03-28 12:43:44,179 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:43:44,179 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:119 279.15/248.73 [2019-03-28 12:44:08,149 WARN L188 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 49 DAG size of output: 42 279.15/248.73 [2019-03-28 12:44:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:44:08,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:44:08,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:44:08,316 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:08,317 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.15/248.73 [2019-03-28 12:44:08,319 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:08,349 INFO L497 ElimStorePlain]: treesize reduction 26, result has 58.7 percent of original size 279.15/248.73 [2019-03-28 12:44:08,349 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:08,349 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 279.15/248.73 [2019-03-28 12:44:08,393 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:08,393 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:44:08,396 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:08,429 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:08,429 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 50 treesize of output 86 279.15/248.73 [2019-03-28 12:44:08,432 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:08,537 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 279.15/248.73 [2019-03-28 12:44:08,538 INFO L497 ElimStorePlain]: treesize reduction 98, result has 57.9 percent of original size 279.15/248.73 [2019-03-28 12:44:08,539 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.15/248.73 [2019-03-28 12:44:08,539 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:119 279.15/248.73 [2019-03-28 12:44:36,745 WARN L188 SmtUtils]: Spent 8.96 s on a formula simplification. DAG size of input: 49 DAG size of output: 27 279.15/248.73 [2019-03-28 12:44:36,750 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 45 predicates after loop cannibalization 279.15/248.73 [2019-03-28 12:44:36,751 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 45 loop predicates 279.15/248.73 [2019-03-28 12:44:36,751 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 63 states and 85 transitions. cyclomatic complexity: 24 Second operand 10 states. 279.15/248.73 [2019-03-28 12:44:49,330 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 63 states and 85 transitions. cyclomatic complexity: 24. Second operand 10 states. Result 1056 states and 1158 transitions. Complement of second has 356 states. 279.15/248.73 [2019-03-28 12:44:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 33 states 2 stem states 29 non-accepting loop states 2 accepting loop states 279.15/248.73 [2019-03-28 12:44:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 279.15/248.73 [2019-03-28 12:44:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 135 transitions. 279.15/248.73 [2019-03-28 12:44:49,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 135 transitions. Stem has 17 letters. Loop has 18 letters. 279.15/248.73 [2019-03-28 12:44:49,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.15/248.73 [2019-03-28 12:44:49,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 135 transitions. Stem has 35 letters. Loop has 18 letters. 279.15/248.73 [2019-03-28 12:44:49,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.15/248.73 [2019-03-28 12:44:49,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 135 transitions. Stem has 17 letters. Loop has 36 letters. 279.15/248.73 [2019-03-28 12:44:49,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.15/248.73 [2019-03-28 12:44:49,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1056 states and 1158 transitions. 279.15/248.73 [2019-03-28 12:44:49,355 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 211 279.15/248.73 [2019-03-28 12:44:49,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1056 states to 318 states and 358 transitions. 279.15/248.73 [2019-03-28 12:44:49,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 279.15/248.73 [2019-03-28 12:44:49,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 279.15/248.73 [2019-03-28 12:44:49,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 358 transitions. 279.15/248.73 [2019-03-28 12:44:49,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.15/248.73 [2019-03-28 12:44:49,358 INFO L706 BuchiCegarLoop]: Abstraction has 318 states and 358 transitions. 279.15/248.73 [2019-03-28 12:44:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 358 transitions. 279.15/248.73 [2019-03-28 12:44:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 82. 279.15/248.73 [2019-03-28 12:44:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. 279.15/248.73 [2019-03-28 12:44:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. 279.15/248.73 [2019-03-28 12:44:49,363 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 106 transitions. 279.15/248.73 [2019-03-28 12:44:49,363 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 106 transitions. 279.15/248.73 [2019-03-28 12:44:49,363 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 279.15/248.73 [2019-03-28 12:44:49,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 106 transitions. 279.15/248.73 [2019-03-28 12:44:49,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 279.15/248.73 [2019-03-28 12:44:49,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.73 [2019-03-28 12:44:49,364 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.73 [2019-03-28 12:44:49,365 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.73 [2019-03-28 12:44:49,365 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.73 [2019-03-28 12:44:49,366 INFO L794 eck$LassoCheckResult]: Stem: 4431#ULTIMATE.startENTRY [136] 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] 4408#L-1 [223] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet19_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 4409#L11 [137] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 4430#L11-1 [130] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 4410#L12 [161] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 4411#L13 [174] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 4436#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 4451#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 4463#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4464#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 4472#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 4471#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 4470#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4469#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 4468#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 4467#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 4454#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 4427#L19 279.15/248.73 [2019-03-28 12:44:49,367 INFO L796 eck$LassoCheckResult]: Loop: 4427#L19 [127] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 4426#L19-1 [124] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_32| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 4424#L19-2 [122] L19-2-->L20: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem13_4| |v_ULTIMATE.start_test_fun_#t~mem12_4|) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_4|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_4|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_3|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13] 4407#L20 [158] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_36|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_20|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14] 4403#L20-1 [322] L20-1-->L19-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= (store |v_#memory_int_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_35|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 4404#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 4414#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 4397#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 4398#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 4437#L15-1 [264] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4438#L15-2 [143] L15-2-->L15-7: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 4401#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 4395#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 4391#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 4392#L16-2 [164] L16-2-->L17: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 4412#L17 [170] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 4421#L17-1 [320] L17-1-->L19-4: Formula: (and (= (select |v_#valid_59| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_31|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_48|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_48|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 4416#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 4417#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 4465#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 4418#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 4419#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4462#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 4461#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 4460#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 4459#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4458#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 4457#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 4455#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 4456#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 4427#L19 279.15/248.73 [2019-03-28 12:44:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.73 [2019-03-28 12:44:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash 425201394, now seen corresponding path program 2 times 279.15/248.73 [2019-03-28 12:44:49,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.73 [2019-03-28 12:44:49,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.73 [2019-03-28 12:44:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:44:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:44:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.73 [2019-03-28 12:44:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1071817097, now seen corresponding path program 1 times 279.15/248.73 [2019-03-28 12:44:49,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.73 [2019-03-28 12:44:49,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.73 [2019-03-28 12:44:49,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:44:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:44:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.73 [2019-03-28 12:44:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1502441896, now seen corresponding path program 1 times 279.15/248.73 [2019-03-28 12:44:49,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.73 [2019-03-28 12:44:49,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.73 [2019-03-28 12:44:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:44:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 279.15/248.73 [2019-03-28 12:44:49,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 279.15/248.73 [2019-03-28 12:44:49,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 279.15/248.73 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 279.15/248.73 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 279.15/248.73 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 279.15/248.73 [2019-03-28 12:44:49,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:44:49,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjunts are in the unsatisfiable core 279.15/248.73 [2019-03-28 12:44:49,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.15/248.73 [2019-03-28 12:44:49,666 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:49,666 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 279.15/248.73 [2019-03-28 12:44:49,667 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,678 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:49,679 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,679 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 279.15/248.73 [2019-03-28 12:44:49,707 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 279.15/248.73 [2019-03-28 12:44:49,708 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,724 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:49,724 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,724 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 279.15/248.73 [2019-03-28 12:44:49,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 279.15/248.73 [2019-03-28 12:44:49,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,744 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:49,744 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,745 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 279.15/248.73 [2019-03-28 12:44:49,918 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 279.15/248.73 [2019-03-28 12:44:49,919 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,940 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:49,941 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,941 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:31 279.15/248.73 [2019-03-28 12:44:49,973 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 279.15/248.73 [2019-03-28 12:44:49,973 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,985 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:49,985 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:49,986 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 279.15/248.73 [2019-03-28 12:44:50,038 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 279.15/248.73 [2019-03-28 12:44:50,038 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:50,042 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.15/248.73 [2019-03-28 12:44:50,042 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.15/248.73 [2019-03-28 12:44:50,043 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 279.15/248.73 [2019-03-28 12:44:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 279.15/248.73 [2019-03-28 12:44:50,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 279.15/248.73 [2019-03-28 12:44:50,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 279.15/248.73 [2019-03-28 12:44:50,609 WARN L188 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 279.15/248.73 [2019-03-28 12:44:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 279.15/248.73 [2019-03-28 12:44:50,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 279.15/248.73 [2019-03-28 12:44:50,712 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. cyclomatic complexity: 26 Second operand 17 states. 279.15/248.73 [2019-03-28 12:44:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.73 [2019-03-28 12:44:51,434 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. 279.15/248.73 [2019-03-28 12:44:51,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 279.15/248.73 [2019-03-28 12:44:51,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 170 transitions. 279.15/248.73 [2019-03-28 12:44:51,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 279.15/248.73 [2019-03-28 12:44:51,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 143 states and 170 transitions. 279.15/248.73 [2019-03-28 12:44:51,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 279.15/248.73 [2019-03-28 12:44:51,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 279.15/248.73 [2019-03-28 12:44:51,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 170 transitions. 279.15/248.73 [2019-03-28 12:44:51,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.15/248.73 [2019-03-28 12:44:51,446 INFO L706 BuchiCegarLoop]: Abstraction has 143 states and 170 transitions. 279.15/248.73 [2019-03-28 12:44:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 170 transitions. 279.15/248.73 [2019-03-28 12:44:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 82. 279.15/248.73 [2019-03-28 12:44:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. 279.15/248.73 [2019-03-28 12:44:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. 279.15/248.73 [2019-03-28 12:44:51,449 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 105 transitions. 279.15/248.73 [2019-03-28 12:44:51,449 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 105 transitions. 279.15/248.73 [2019-03-28 12:44:51,449 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 279.15/248.73 [2019-03-28 12:44:51,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 105 transitions. 279.15/248.73 [2019-03-28 12:44:51,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 279.15/248.73 [2019-03-28 12:44:51,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.15/248.73 [2019-03-28 12:44:51,450 INFO L119 BuchiIsEmpty]: Starting construction of run 279.15/248.73 [2019-03-28 12:44:51,451 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.73 [2019-03-28 12:44:51,451 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.15/248.73 [2019-03-28 12:44:51,452 INFO L794 eck$LassoCheckResult]: Stem: 4835#ULTIMATE.startENTRY [136] 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] 4811#L-1 [223] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet19_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 4812#L11 [137] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 4832#L11-1 [130] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 4813#L12 [161] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 4814#L13 [174] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 4838#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 4853#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 4871#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4870#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 4869#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 4868#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 4867#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4866#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 4796#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 4797#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 4815#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 4816#L19 279.15/248.73 [2019-03-28 12:44:51,453 INFO L796 eck$LassoCheckResult]: Loop: 4816#L19 [127] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 4830#L19-1 [124] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_32| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_32|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 4829#L19-2 [122] L19-2-->L20: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem13_4| |v_ULTIMATE.start_test_fun_#t~mem12_4|) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_4|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_4|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_3|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13] 4810#L20 [158] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_36|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_20|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14] 4806#L20-1 [322] L20-1-->L19-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= (store |v_#memory_int_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_35|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 4807#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 4818#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 4799#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 4800#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 4820#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4839#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 4836#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 4833#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 4808#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4803#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 4804#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 4792#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 4793#L16-2 [164] L16-2-->L17: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 4828#L17 [170] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 4825#L17-1 [320] L17-1-->L19-4: Formula: (and (= (select |v_#valid_59| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_31|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_48|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_48|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 4822#L19-4 [119] L19-4-->L25: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_40|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_40|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_23|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 4823#L25 [321] L25-->L15-9: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_33| (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_60|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 4865#L15-9 [104] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 4864#L15 [116] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 4862#L15-1 [265] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4861#L15-2 [144] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|} AuxVars[] AssignedVars[] 4860#L15-4 [140] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 4859#L15-5 [133] L15-5-->L15-6: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 4858#L15-6 [282] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 4857#L15-7 [108] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 4856#L16 [150] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 4855#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_9 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_12) v_ULTIMATE.start_test_fun_~z_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 4854#L16-2 [202] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 4816#L19 279.15/248.73 [2019-03-28 12:44:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.73 [2019-03-28 12:44:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash 425201394, now seen corresponding path program 3 times 279.15/248.73 [2019-03-28 12:44:51,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.73 [2019-03-28 12:44:51,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.73 [2019-03-28 12:44:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:51,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:44:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.15/248.73 [2019-03-28 12:44:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.15/248.73 [2019-03-28 12:44:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1081170960, now seen corresponding path program 1 times 279.15/248.73 [2019-03-28 12:44:51,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.15/248.73 [2019-03-28 12:44:51,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.15/248.73 [2019-03-28 12:44:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:51,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.15/248.73 [2019-03-28 12:44:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.15/248.73 [2019-03-28 12:44:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.15/248.73 [2019-03-28 12:44:51,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.15/248.73 [2019-03-28 12:44:51,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 279.15/248.73 [2019-03-28 12:44:51,531 INFO L811 eck$LassoCheckResult]: loop already infeasible 279.15/248.73 [2019-03-28 12:44:51,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 279.15/248.73 [2019-03-28 12:44:51,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 279.15/248.73 [2019-03-28 12:44:51,532 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. cyclomatic complexity: 25 Second operand 7 states. 279.15/248.73 [2019-03-28 12:44:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.15/248.73 [2019-03-28 12:44:51,788 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. 279.15/248.73 [2019-03-28 12:44:51,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 279.15/248.73 [2019-03-28 12:44:51,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 91 transitions. 279.15/248.73 [2019-03-28 12:44:51,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 279.15/248.73 [2019-03-28 12:44:51,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. 279.15/248.73 [2019-03-28 12:44:51,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 279.15/248.73 [2019-03-28 12:44:51,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 279.15/248.73 [2019-03-28 12:44:51,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 279.15/248.73 [2019-03-28 12:44:51,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 279.15/248.73 [2019-03-28 12:44:51,799 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 279.15/248.73 [2019-03-28 12:44:51,799 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 279.15/248.73 [2019-03-28 12:44:51,800 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 279.15/248.73 [2019-03-28 12:44:51,800 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 279.15/248.73 [2019-03-28 12:44:51,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 279.15/248.73 [2019-03-28 12:44:51,800 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 279.15/248.73 [2019-03-28 12:44:51,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 279.15/248.73 [2019-03-28 12:44:51,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:51 BasicIcfg 279.15/248.73 [2019-03-28 12:44:51,806 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 279.15/248.73 [2019-03-28 12:44:51,807 INFO L168 Benchmark]: Toolchain (without parser) took 244476.58 ms. Allocated memory was 649.6 MB in the beginning and 903.9 MB in the end (delta: 254.3 MB). Free memory was 563.8 MB in the beginning and 678.3 MB in the end (delta: -114.4 MB). Peak memory consumption was 139.8 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,807 INFO L168 Benchmark]: CDTParser took 0.18 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. 279.15/248.73 [2019-03-28 12:44:51,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.38 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 563.8 MB in the beginning and 644.2 MB in the end (delta: -80.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 679.5 MB. Free memory was 644.2 MB in the beginning and 642.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,810 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 679.5 MB. Free memory was 642.1 MB in the beginning and 641.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,810 INFO L168 Benchmark]: RCFGBuilder took 453.06 ms. Allocated memory is still 679.5 MB. Free memory was 641.0 MB in the beginning and 610.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,810 INFO L168 Benchmark]: BlockEncodingV2 took 154.26 ms. Allocated memory is still 679.5 MB. Free memory was 610.1 MB in the beginning and 594.9 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,811 INFO L168 Benchmark]: TraceAbstraction took 2474.46 ms. Allocated memory was 679.5 MB in the beginning and 747.6 MB in the end (delta: 68.2 MB). Free memory was 594.9 MB in the beginning and 594.1 MB in the end (delta: 768.8 kB). Peak memory consumption was 68.9 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,811 INFO L168 Benchmark]: BuchiAutomizer took 241007.04 ms. Allocated memory was 747.6 MB in the beginning and 903.9 MB in the end (delta: 156.2 MB). Free memory was 594.1 MB in the beginning and 678.3 MB in the end (delta: -84.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 50.3 GB. 279.15/248.73 [2019-03-28 12:44:51,813 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 279.15/248.73 --- Results --- 279.15/248.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 279.15/248.73 - StatisticsResult: Initial Icfg 279.15/248.73 73 locations, 77 edges 279.15/248.73 - StatisticsResult: Encoded RCFG 279.15/248.73 65 locations, 123 edges 279.15/248.73 * Results from de.uni_freiburg.informatik.ultimate.core: 279.15/248.73 - StatisticsResult: Toolchain Benchmarks 279.15/248.73 Benchmark results are: 279.15/248.73 * CDTParser took 0.18 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. 279.15/248.73 * CACSL2BoogieTranslator took 310.38 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 563.8 MB in the beginning and 644.2 MB in the end (delta: -80.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 279.15/248.73 * Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 679.5 MB. Free memory was 644.2 MB in the beginning and 642.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 279.15/248.73 * Boogie Preprocessor took 26.32 ms. Allocated memory is still 679.5 MB. Free memory was 642.1 MB in the beginning and 641.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 279.15/248.73 * RCFGBuilder took 453.06 ms. Allocated memory is still 679.5 MB. Free memory was 641.0 MB in the beginning and 610.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. 279.15/248.73 * BlockEncodingV2 took 154.26 ms. Allocated memory is still 679.5 MB. Free memory was 610.1 MB in the beginning and 594.9 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 50.3 GB. 279.15/248.73 * TraceAbstraction took 2474.46 ms. Allocated memory was 679.5 MB in the beginning and 747.6 MB in the end (delta: 68.2 MB). Free memory was 594.9 MB in the beginning and 594.1 MB in the end (delta: 768.8 kB). Peak memory consumption was 68.9 MB. Max. memory is 50.3 GB. 279.15/248.73 * BuchiAutomizer took 241007.04 ms. Allocated memory was 747.6 MB in the beginning and 903.9 MB in the end (delta: 156.2 MB). Free memory was 594.1 MB in the beginning and 678.3 MB in the end (delta: -84.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 50.3 GB. 279.15/248.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #length 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #memory_int 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #memory_int 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #memory_int 279.15/248.73 - GenericResult: Unfinished Backtranslation 279.15/248.73 unknown boogie variable #memory_int 279.15/248.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 25]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 27]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 25]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 25]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 20]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 25]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 20]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 14]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 20]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 13]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 19]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 20]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 14]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 19]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 19]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 12]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 13]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 19]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 12]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 27]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.15/248.73 For all program executions holds that pointer dereference always succeeds at this location 279.15/248.73 - AllSpecificationsHoldResult: All specifications hold 279.15/248.73 38 specifications checked. All of them hold 279.15/248.73 - InvariantResult [Line: 14]: Loop Invariant 279.15/248.73 [2019-03-28 12:44:51,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 [2019-03-28 12:44:51,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 [2019-03-28 12:44:51,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 [2019-03-28 12:44:51,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 [2019-03-28 12:44:51,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 [2019-03-28 12:44:51,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 [2019-03-28 12:44:51,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 [2019-03-28 12:44:51,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.15/248.73 Derived loop invariant: ((((((((((\valid[z_ref] == 1 && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 0 == z_ref) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 4 == unknown-#length-unknown[z_ref]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 279.15/248.73 - StatisticsResult: Ultimate Automizer benchmark data 279.15/248.73 CFG has 1 procedures, 65 locations, 38 error locations. SAFE Result, 2.3s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 653 SDslu, 7 SDs, 0 SdLazy, 743 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 279.15/248.73 - StatisticsResult: Constructed decomposition of program 279.15/248.73 Your program was decomposed into 7 terminating modules (5 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 58 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 33 locations. 5 modules have a trivial ranking function, the largest among these consists of 17 locations. 279.15/248.73 - StatisticsResult: Timing statistics 279.15/248.73 BüchiAutomizer plugin needed 240.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 3.0s. Büchi inclusion checks took 230.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 491 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 134 SDtfs, 2703 SDslu, 998 SDs, 0 SdLazy, 3868 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital438 mio100 ax100 hnf100 lsp98 ukn55 mio100 lsp38 div100 bol100 ite100 ukn100 eq195 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 279.15/248.73 - TerminationAnalysisResult: Termination proven 279.15/248.73 Buchi Automizer proved that your program is terminating 279.15/248.73 RESULT: Ultimate proved your program to be correct! 279.15/248.73 !SESSION 2019-03-28 12:40:44.107 ----------------------------------------------- 279.15/248.73 eclipse.buildId=unknown 279.15/248.73 java.version=1.8.0_181 279.15/248.73 java.vendor=Oracle Corporation 279.15/248.73 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 279.15/248.73 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 279.15/248.73 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 279.15/248.73 279.15/248.73 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:52.054 279.15/248.73 !MESSAGE The workspace will exit with unsaved changes in this session. 279.15/248.73 Received shutdown request... 279.15/248.73 Ultimate: 279.15/248.73 GTK+ Version Check 279.15/248.73 EOF