YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 11:06:11,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 11:06:11,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 11:06:11,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 11:06:11,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 11:06:11,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 11:06:11,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 11:06:11,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 11:06:11,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 11:06:11,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 11:06:11,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 11:06:11,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 11:06:11,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 11:06:11,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 11:06:11,481 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 11:06:11,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 11:06:11,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 11:06:11,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 11:06:11,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 11:06:11,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 11:06:11,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 11:06:11,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 11:06:11,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 11:06:11,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 11:06:11,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 11:06:11,493 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 11:06:11,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 11:06:11,495 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 11:06:11,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 11:06:11,495 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 11:06:11,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 11:06:11,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 11:06:11,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 11:06:11,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 11:06:11,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 11:06:11,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 11:06:11,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 11:06:11,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 11:06:11,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 11:06:11,501 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 11:06:11,515 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 11:06:11,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 11:06:11,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 11:06:11,516 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 11:06:11,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 11:06:11,517 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:06:11,517 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 11:06:11,517 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 11:06:11,517 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 11:06:11,517 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 11:06:11,518 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 11:06:11,518 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 11:06:11,518 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 11:06:11,518 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 11:06:11,518 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 11:06:11,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 11:06:11,519 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 11:06:11,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 11:06:11,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 11:06:11,519 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 11:06:11,519 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 11:06:11,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 11:06:11,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 11:06:11,520 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 11:06:11,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 11:06:11,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 11:06:11,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 11:06:11,520 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 11:06:11,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 11:06:11,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 11:06:11,559 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 11:06:11,562 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 11:06:11,564 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 11:06:11,564 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 11:06:11,565 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 11:06:11,634 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/17535bd28a5a4077ab2f2cc2f1e3326b/FLAG2ccc6a855 [2020-06-22 11:06:11,984 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 11:06:11,984 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 11:06:11,985 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 11:06:11,991 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/17535bd28a5a4077ab2f2cc2f1e3326b/FLAG2ccc6a855 [2020-06-22 11:06:12,399 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/17535bd28a5a4077ab2f2cc2f1e3326b [2020-06-22 11:06:12,410 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 11:06:12,411 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 11:06:12,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 11:06:12,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 11:06:12,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 11:06:12,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64098216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12, skipping insertion in model container [2020-06-22 11:06:12,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 11:06:12,445 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 11:06:12,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:06:12,670 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 11:06:12,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:06:12,705 INFO L195 MainTranslator]: Completed translation [2020-06-22 11:06:12,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12 WrapperNode [2020-06-22 11:06:12,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 11:06:12,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 11:06:12,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 11:06:12,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 11:06:12,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 11:06:12,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 11:06:12,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 11:06:12,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 11:06:12,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 11:06:12,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 11:06:12,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 11:06:12,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 11:06:12,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 11:06:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 11:06:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 11:06:12,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 11:06:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 11:06:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 11:06:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 11:06:13,221 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 11:06:13,222 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 11:06:13,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13 BoogieIcfgContainer [2020-06-22 11:06:13,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 11:06:13,224 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 11:06:13,225 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 11:06:13,227 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 11:06:13,227 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,247 INFO L313 BlockEncoder]: Initial Icfg 76 locations, 81 edges [2020-06-22 11:06:13,248 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 11:06:13,249 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 11:06:13,250 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 11:06:13,250 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:06:13,253 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 11:06:13,254 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 11:06:13,254 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 11:06:13,285 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 11:06:13,328 INFO L200 BlockEncoder]: SBE split 42 edges [2020-06-22 11:06:13,333 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 11:06:13,335 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:06:13,360 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 11:06:13,363 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 11:06:13,364 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 11:06:13,365 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:06:13,365 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 11:06:13,366 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 11:06:13,367 INFO L313 BlockEncoder]: Encoded RCFG 66 locations, 116 edges [2020-06-22 11:06:13,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:06:13 BasicIcfg [2020-06-22 11:06:13,367 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 11:06:13,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 11:06:13,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 11:06:13,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 11:06:13,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 11:06:12" (1/4) ... [2020-06-22 11:06:13,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a3c410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:06:13, skipping insertion in model container [2020-06-22 11:06:13,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (2/4) ... [2020-06-22 11:06:13,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a3c410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:06:13, skipping insertion in model container [2020-06-22 11:06:13,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13" (3/4) ... [2020-06-22 11:06:13,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a3c410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:06:13, skipping insertion in model container [2020-06-22 11:06:13,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:06:13" (4/4) ... [2020-06-22 11:06:13,376 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:06:13,386 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 11:06:13,394 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2020-06-22 11:06:13,410 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2020-06-22 11:06:13,439 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:06:13,440 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 11:06:13,440 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 11:06:13,440 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:06:13,441 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:06:13,441 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:06:13,441 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 11:06:13,441 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:06:13,441 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 11:06:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-06-22 11:06:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:06:13,463 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:13,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:06:13,464 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash 176568, now seen corresponding path program 1 times [2020-06-22 11:06:13,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:13,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:13,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:13,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:13,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:13,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:13,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:13,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:13,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:13,675 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-06-22 11:06:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:13,946 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2020-06-22 11:06:13,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:13,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:06:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:13,962 INFO L225 Difference]: With dead ends: 66 [2020-06-22 11:06:13,962 INFO L226 Difference]: Without dead ends: 56 [2020-06-22 11:06:13,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-06-22 11:06:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-06-22 11:06:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 11:06:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 96 transitions. [2020-06-22 11:06:14,007 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 96 transitions. Word has length 3 [2020-06-22 11:06:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,008 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 96 transitions. [2020-06-22 11:06:14,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 96 transitions. [2020-06-22 11:06:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:06:14,009 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:06:14,009 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash 176570, now seen corresponding path program 1 times [2020-06-22 11:06:14,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:14,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,038 INFO L87 Difference]: Start difference. First operand 56 states and 96 transitions. Second operand 3 states. [2020-06-22 11:06:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,171 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2020-06-22 11:06:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:06:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,173 INFO L225 Difference]: With dead ends: 66 [2020-06-22 11:06:14,173 INFO L226 Difference]: Without dead ends: 56 [2020-06-22 11:06:14,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-06-22 11:06:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-06-22 11:06:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 11:06:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2020-06-22 11:06:14,181 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 3 [2020-06-22 11:06:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,181 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2020-06-22 11:06:14,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2020-06-22 11:06:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:06:14,182 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:06:14,182 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,182 INFO L82 PathProgramCache]: Analyzing trace with hash 176571, now seen corresponding path program 1 times [2020-06-22 11:06:14,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:14,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,244 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 3 states. [2020-06-22 11:06:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,447 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2020-06-22 11:06:14,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:06:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,449 INFO L225 Difference]: With dead ends: 56 [2020-06-22 11:06:14,449 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 11:06:14,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 11:06:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 11:06:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 11:06:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2020-06-22 11:06:14,455 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 3 [2020-06-22 11:06:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,455 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2020-06-22 11:06:14,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2020-06-22 11:06:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 11:06:14,456 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 11:06:14,456 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,457 INFO L82 PathProgramCache]: Analyzing trace with hash 5470070, now seen corresponding path program 1 times [2020-06-22 11:06:14,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:14,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,496 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2020-06-22 11:06:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,589 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2020-06-22 11:06:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 11:06:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,591 INFO L225 Difference]: With dead ends: 45 [2020-06-22 11:06:14,591 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 11:06:14,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 11:06:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 11:06:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 11:06:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2020-06-22 11:06:14,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 4 [2020-06-22 11:06:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,596 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2020-06-22 11:06:14,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2020-06-22 11:06:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 11:06:14,597 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 11:06:14,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash 5470072, now seen corresponding path program 1 times [2020-06-22 11:06:14,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:14,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,622 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2020-06-22 11:06:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,689 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-06-22 11:06:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 11:06:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,690 INFO L225 Difference]: With dead ends: 45 [2020-06-22 11:06:14,691 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 11:06:14,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 11:06:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 11:06:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 11:06:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2020-06-22 11:06:14,695 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 4 [2020-06-22 11:06:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,695 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2020-06-22 11:06:14,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2020-06-22 11:06:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 11:06:14,696 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 11:06:14,696 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,697 INFO L82 PathProgramCache]: Analyzing trace with hash 5470073, now seen corresponding path program 1 times [2020-06-22 11:06:14,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:14,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,730 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 3 states. [2020-06-22 11:06:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,808 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2020-06-22 11:06:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 11:06:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,809 INFO L225 Difference]: With dead ends: 40 [2020-06-22 11:06:14,809 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 11:06:14,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 11:06:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 11:06:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 11:06:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2020-06-22 11:06:14,813 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 4 [2020-06-22 11:06:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,813 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2020-06-22 11:06:14,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2020-06-22 11:06:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:06:14,814 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:14,814 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash 169570124, now seen corresponding path program 1 times [2020-06-22 11:06:14,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:14,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,842 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 3 states. [2020-06-22 11:06:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,909 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2020-06-22 11:06:14,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:06:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,910 INFO L225 Difference]: With dead ends: 33 [2020-06-22 11:06:14,910 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 11:06:14,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 11:06:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 11:06:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 11:06:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2020-06-22 11:06:14,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 5 [2020-06-22 11:06:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,914 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2020-06-22 11:06:14,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2020-06-22 11:06:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:06:14,915 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:14,915 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash 169570126, now seen corresponding path program 1 times [2020-06-22 11:06:14,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:14,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,938 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 3 states. [2020-06-22 11:06:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,977 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-06-22 11:06:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:06:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,978 INFO L225 Difference]: With dead ends: 33 [2020-06-22 11:06:14,978 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 11:06:14,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 11:06:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 11:06:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 11:06:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2020-06-22 11:06:14,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 5 [2020-06-22 11:06:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,982 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2020-06-22 11:06:14,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2020-06-22 11:06:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:06:14,983 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:14,983 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,983 INFO L82 PathProgramCache]: Analyzing trace with hash 169570127, now seen corresponding path program 1 times [2020-06-22 11:06:14,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:15,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:15,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:15,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:15,011 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2020-06-22 11:06:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:15,063 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-06-22 11:06:15,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:15,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:06:15,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:15,064 INFO L225 Difference]: With dead ends: 29 [2020-06-22 11:06:15,064 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 11:06:15,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 11:06:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 11:06:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 11:06:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 11:06:15,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 11:06:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:15,066 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:15,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:06:15,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 11:06:15,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 11:06:15,098 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,099 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 11:06:15,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,100 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 11:06:15,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 11:06:15,100 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 11:06:15,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 11:06:15,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 11:06:15,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 11:06:15,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2020-06-22 11:06:15,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 11:06:15,103 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 24) no Hoare annotation was computed. [2020-06-22 11:06:15,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:06:15,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:06:15,103 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 28) no Hoare annotation was computed. [2020-06-22 11:06:15,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,103 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 28) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~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) (= 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))) [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point L17-4(lines 17 28) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point L13-5(lines 13 16) no Hoare annotation was computed. [2020-06-22 11:06:15,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 11:06:15,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 11:06:15,106 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 11:06:15,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-06-22 11:06:15,106 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 11:06:15,106 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 26) no Hoare annotation was computed. [2020-06-22 11:06:15,106 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 26) no Hoare annotation was computed. [2020-06-22 11:06:15,106 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 11:06:15,106 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 11:06:15,107 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 11:06:15,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:15,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:15,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:15,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:15,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:15,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:15,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:06:15 BasicIcfg [2020-06-22 11:06:15,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 11:06:15,126 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 11:06:15,127 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 11:06:15,130 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 11:06:15,131 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:15,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 11:06:12" (1/5) ... [2020-06-22 11:06:15,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c4ef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:06:15, skipping insertion in model container [2020-06-22 11:06:15,132 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:15,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12" (2/5) ... [2020-06-22 11:06:15,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c4ef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:06:15, skipping insertion in model container [2020-06-22 11:06:15,132 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:15,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13" (3/5) ... [2020-06-22 11:06:15,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c4ef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:06:15, skipping insertion in model container [2020-06-22 11:06:15,133 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:15,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:06:13" (4/5) ... [2020-06-22 11:06:15,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c4ef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:06:15, skipping insertion in model container [2020-06-22 11:06:15,133 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:15,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:06:15" (5/5) ... [2020-06-22 11:06:15,135 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:06:15,155 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:06:15,156 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 11:06:15,156 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 11:06:15,156 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:06:15,156 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:06:15,156 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:06:15,156 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 11:06:15,156 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:06:15,156 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 11:06:15,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states. [2020-06-22 11:06:15,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 11:06:15,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:15,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:15,172 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,172 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,172 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 11:06:15,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states. [2020-06-22 11:06:15,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 11:06:15,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:15,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:15,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,181 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [239] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 11#L10true [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 57#L10-1true [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 28#L11true [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 47#L12true [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 65#L13true [257] L13-->L13-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_2| (<= |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 63#L13-1true [178] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 39#L13-5true [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 67#L17-3true [2020-06-22 11:06:15,182 INFO L796 eck$LassoCheckResult]: Loop: 67#L17-3true [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 51#L17-1true [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 8#L18true [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 6#L18-1true [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 3#L18-2true [107] L18-2-->L19: 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] 24#L19true [142] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 23#L19-1true [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 16#L18-4true [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 36#L27true [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 67#L17-3true [2020-06-22 11:06:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1993557259, now seen corresponding path program 1 times [2020-06-22 11:06:15,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:15,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:15,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:15,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:15,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 11:06:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash -774875025, now seen corresponding path program 1 times [2020-06-22 11:06:15,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:15,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:15,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:15,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:15,365 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-06-22 11:06:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:15,554 INFO L93 Difference]: Finished difference Result 68 states and 118 transitions. [2020-06-22 11:06:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:15,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 118 transitions. [2020-06-22 11:06:15,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 11:06:15,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 24 states and 33 transitions. [2020-06-22 11:06:15,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 11:06:15,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 11:06:15,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2020-06-22 11:06:15,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:06:15,563 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-06-22 11:06:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2020-06-22 11:06:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 11:06:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 11:06:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-06-22 11:06:15,565 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-06-22 11:06:15,566 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-06-22 11:06:15,566 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 11:06:15,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-06-22 11:06:15,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 11:06:15,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:15,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:15,567 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,567 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,568 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 159#L-1 [239] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 160#L10 [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 155#L10-1 [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 156#L11 [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 163#L12 [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 164#L13 [256] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 165#L13-1 [179] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 161#L13-3 [175] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| 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_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 154#L13-4 [270] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 153#L13-5 [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 149#L17-3 [2020-06-22 11:06:15,569 INFO L796 eck$LassoCheckResult]: Loop: 149#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 143#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 144#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 150#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 145#L18-2 [107] L18-2-->L19: 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] 147#L19 [142] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 151#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 152#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 148#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 149#L17-3 [2020-06-22 11:06:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash 252242058, now seen corresponding path program 1 times [2020-06-22 11:06:15,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:15,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash -774875025, now seen corresponding path program 2 times [2020-06-22 11:06:15,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:15,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:15,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:15,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1973025286, now seen corresponding path program 1 times [2020-06-22 11:06:15,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:15,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:06:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:16,151 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2020-06-22 11:06:16,318 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-06-22 11:06:16,333 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:06:16,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:06:16,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:06:16,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:06:16,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:06:16,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:06:16,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:06:16,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:06:16,336 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 11:06:16,336 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:06:16,336 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:06:16,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,749 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-06-22 11:06:16,858 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 11:06:16,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:16,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:17,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:06:17,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:06:17,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:17,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:17,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:17,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:17,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:17,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:17,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:17,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:17,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:17,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:17,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:17,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:17,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:17,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:17,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:17,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:17,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:17,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:17,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:17,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:17,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:17,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:17,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:17,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:17,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:17,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:17,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:17,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:17,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:17,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:17,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:17,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:17,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:17,417 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:06:17,437 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 11:06:17,437 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 11:06:17,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:06:17,441 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:06:17,441 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:06:17,442 INFO L520 LassoAnalysis]: Termination argument consisting of: 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 11:06:17,517 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 11:06:17,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:17,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:17,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:17,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:17,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 11:06:17,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:17,808 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:17,809 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 65 [2020-06-22 11:06:17,817 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:17,853 INFO L497 ElimStorePlain]: treesize reduction 29, result has 58.0 percent of original size [2020-06-22 11:06:17,854 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 11:06:17,855 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2020-06-22 11:06:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:18,143 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:06:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:18,151 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:06:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:18,160 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:06:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:18,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 11:06:18,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:18,177 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 11:06:18,178 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:18,187 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:18,188 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:18,188 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:06:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:18,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 11:06:18,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:18,220 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 11:06:18,220 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:18,229 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:18,229 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:18,229 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:06:18,281 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:18,282 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 65 [2020-06-22 11:06:18,289 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:18,339 INFO L497 ElimStorePlain]: treesize reduction 40, result has 50.0 percent of original size [2020-06-22 11:06:18,340 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 11:06:18,340 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2020-06-22 11:06:18,342 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 11:06:18,347 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 10 loop predicates [2020-06-22 11:06:18,348 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 33 transitions. cyclomatic complexity: 10 Second operand 10 states. [2020-06-22 11:06:20,893 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 33 transitions. cyclomatic complexity: 10. Second operand 10 states. Result 484 states and 547 transitions. Complement of second has 214 states. [2020-06-22 11:06:20,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 63 states 4 stem states 57 non-accepting loop states 2 accepting loop states [2020-06-22 11:06:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 11:06:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 236 transitions. [2020-06-22 11:06:20,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 236 transitions. Stem has 11 letters. Loop has 9 letters. [2020-06-22 11:06:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 236 transitions. Stem has 20 letters. Loop has 9 letters. [2020-06-22 11:06:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 236 transitions. Stem has 11 letters. Loop has 18 letters. [2020-06-22 11:06:20,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:20,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 547 transitions. [2020-06-22 11:06:20,919 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 158 [2020-06-22 11:06:20,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 310 states and 353 transitions. [2020-06-22 11:06:20,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 [2020-06-22 11:06:20,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2020-06-22 11:06:20,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 310 states and 353 transitions. [2020-06-22 11:06:20,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:06:20,924 INFO L706 BuchiCegarLoop]: Abstraction has 310 states and 353 transitions. [2020-06-22 11:06:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states and 353 transitions. [2020-06-22 11:06:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 67. [2020-06-22 11:06:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-06-22 11:06:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2020-06-22 11:06:20,932 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2020-06-22 11:06:20,933 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2020-06-22 11:06:20,933 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 11:06:20,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2020-06-22 11:06:20,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 11:06:20,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:20,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:20,935 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:20,935 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:20,936 INFO L794 eck$LassoCheckResult]: Stem: 1255#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1251#L-1 [239] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1253#L10 [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1271#L10-1 [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 1270#L11 [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 1269#L12 [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 1268#L13 [256] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1267#L13-1 [179] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1266#L13-3 [175] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| 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_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1265#L13-4 [270] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1264#L13-5 [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1262#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1263#L17-1 [2020-06-22 11:06:20,936 INFO L796 eck$LassoCheckResult]: Loop: 1263#L17-1 [281] L17-1-->L18: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1284#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1283#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 1282#L18-2 [107] L18-2-->L19: 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] 1281#L19 [142] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1280#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1279#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1272#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1278#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1263#L17-1 [2020-06-22 11:06:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:20,936 INFO L82 PathProgramCache]: Analyzing trace with hash -770430609, now seen corresponding path program 1 times [2020-06-22 11:06:20,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:20,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:20,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:20,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:20,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -758045662, now seen corresponding path program 1 times [2020-06-22 11:06:20,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:20,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:20,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -773212556, now seen corresponding path program 1 times [2020-06-22 11:06:20,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:20,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:20,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:21,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:21,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 11:06:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 11:06:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 11:06:21,103 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. cyclomatic complexity: 19 Second operand 5 states. [2020-06-22 11:06:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:21,203 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2020-06-22 11:06:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 11:06:21,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 98 transitions. [2020-06-22 11:06:21,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 11:06:21,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 98 transitions. [2020-06-22 11:06:21,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-06-22 11:06:21,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-06-22 11:06:21,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 98 transitions. [2020-06-22 11:06:21,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:06:21,215 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 98 transitions. [2020-06-22 11:06:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 98 transitions. [2020-06-22 11:06:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2020-06-22 11:06:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-06-22 11:06:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2020-06-22 11:06:21,220 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2020-06-22 11:06:21,220 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2020-06-22 11:06:21,220 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 11:06:21,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 83 transitions. [2020-06-22 11:06:21,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 11:06:21,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:21,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:21,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:21,222 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:21,223 INFO L794 eck$LassoCheckResult]: Stem: 1416#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1411#L-1 [237] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1412#L10 [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1406#L10-1 [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 1407#L11 [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 1417#L12 [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 1418#L13 [256] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1419#L13-1 [179] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1414#L13-3 [175] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| 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_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1408#L13-4 [270] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1404#L13-5 [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1405#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1444#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1443#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1442#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 1387#L18-2 [107] L18-2-->L19: 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] 1388#L19 [2020-06-22 11:06:21,223 INFO L796 eck$LassoCheckResult]: Loop: 1388#L19 [142] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1400#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1401#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1391#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1392#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1383#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1384#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1450#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 1441#L18-2 [107] L18-2-->L19: 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] 1388#L19 [2020-06-22 11:06:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1019085604, now seen corresponding path program 1 times [2020-06-22 11:06:21,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:21,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:21,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1595695535, now seen corresponding path program 3 times [2020-06-22 11:06:21,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:21,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:21,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash -629393940, now seen corresponding path program 1 times [2020-06-22 11:06:21,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:21,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:21,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:06:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:21,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:21,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 11:06:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:21,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 11:06:21,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:21,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:21,599 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 11:06:21,600 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,608 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:21,608 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,608 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2020-06-22 11:06:21,636 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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 [2020-06-22 11:06:21,636 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,644 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:21,645 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,645 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2020-06-22 11:06:21,650 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 11:06:21,650 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,659 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:21,659 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,660 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-06-22 11:06:21,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:21,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:21,735 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-06-22 11:06:21,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,757 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:21,757 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,758 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2020-06-22 11:06:21,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:21,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:21,807 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 [2020-06-22 11:06:21,808 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,820 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:21,821 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,821 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:18 [2020-06-22 11:06:21,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:21,898 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 [2020-06-22 11:06:21,898 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,904 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:21,904 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:21,904 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2020-06-22 11:06:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 11:06:21,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2020-06-22 11:06:22,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 11:06:22,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2020-06-22 11:06:22,055 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. cyclomatic complexity: 18 Second operand 19 states. [2020-06-22 11:06:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:22,910 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2020-06-22 11:06:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 11:06:22,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 148 transitions. [2020-06-22 11:06:22,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2020-06-22 11:06:22,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 122 states and 139 transitions. [2020-06-22 11:06:22,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2020-06-22 11:06:22,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2020-06-22 11:06:22,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 139 transitions. [2020-06-22 11:06:22,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:06:22,922 INFO L706 BuchiCegarLoop]: Abstraction has 122 states and 139 transitions. [2020-06-22 11:06:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 139 transitions. [2020-06-22 11:06:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 37. [2020-06-22 11:06:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 11:06:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-06-22 11:06:22,924 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-06-22 11:06:22,924 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-06-22 11:06:22,924 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 11:06:22,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2020-06-22 11:06:22,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 11:06:22,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:22,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:22,926 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:22,926 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:22,927 INFO L794 eck$LassoCheckResult]: Stem: 1716#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1713#L-1 [239] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1714#L10 [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1708#L10-1 [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 1709#L11 [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 1717#L12 [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 1718#L13 [256] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1719#L13-1 [179] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1715#L13-3 [175] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| 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_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1710#L13-4 [270] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1705#L13-5 [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1706#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1696#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1697#L18 [2020-06-22 11:06:22,928 INFO L796 eck$LassoCheckResult]: Loop: 1697#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1702#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 1698#L18-2 [214] L18-2-->L21: 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] 1699#L21 [121] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1711#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1712#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14] 1720#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 1721#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1730#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1729#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1728#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1727#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1726#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 1725#L18-2 [107] L18-2-->L19: 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] 1707#L19 [142] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1703#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1704#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1700#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1701#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1722#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1697#L18 [2020-06-22 11:06:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1886455177, now seen corresponding path program 1 times [2020-06-22 11:06:22,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:22,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:22,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1841891494, now seen corresponding path program 1 times [2020-06-22 11:06:22,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:22,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:22,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:22,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:22,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:23,433 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2020-06-22 11:06:23,810 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 22 [2020-06-22 11:06:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:23,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:23,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 11:06:23,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:23,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 11:06:23,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:23,965 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:23,966 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 [2020-06-22 11:06:23,970 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:23,996 INFO L497 ElimStorePlain]: treesize reduction 34, result has 42.4 percent of original size [2020-06-22 11:06:23,997 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 11:06:23,997 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2020-06-22 11:06:24,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:24,109 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:24,109 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 116 [2020-06-22 11:06:24,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:24,215 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:24,216 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 109 [2020-06-22 11:06:24,229 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:24,329 INFO L340 Elim1Store]: treesize reduction 8, result has 91.9 percent of original size [2020-06-22 11:06:24,330 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 108 [2020-06-22 11:06:24,343 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:24,353 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2020-06-22 11:06:24,353 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,500 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2020-06-22 11:06:24,500 INFO L340 Elim1Store]: treesize reduction 28, result has 82.9 percent of original size [2020-06-22 11:06:24,501 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 155 [2020-06-22 11:06:24,617 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,798 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 35 [2020-06-22 11:06:24,799 INFO L497 ElimStorePlain]: treesize reduction 1206, result has 5.5 percent of original size [2020-06-22 11:06:24,800 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 4 xjuncts. [2020-06-22 11:06:24,800 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:54 [2020-06-22 11:06:24,844 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:24,845 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-06-22 11:06:24,846 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 11:06:24,852 INFO L497 ElimStorePlain]: treesize reduction 13, result has 18.8 percent of original size [2020-06-22 11:06:24,852 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,852 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-06-22 11:06:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:24,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 11:06:24,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2020-06-22 11:06:24,883 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:06:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 11:06:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-06-22 11:06:24,884 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 12 Second operand 17 states. [2020-06-22 11:06:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:25,490 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-06-22 11:06:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 11:06:25,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2020-06-22 11:06:25,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 11:06:25,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2020-06-22 11:06:25,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-06-22 11:06:25,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-06-22 11:06:25,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2020-06-22 11:06:25,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:06:25,507 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-06-22 11:06:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2020-06-22 11:06:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2020-06-22 11:06:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 11:06:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-06-22 11:06:25,509 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-06-22 11:06:25,509 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-06-22 11:06:25,509 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 11:06:25,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-06-22 11:06:25,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 11:06:25,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:25,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:25,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:25,511 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:25,511 INFO L794 eck$LassoCheckResult]: Stem: 1877#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1874#L-1 [239] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1875#L10 [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1869#L10-1 [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 1870#L11 [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 1878#L12 [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 1879#L13 [256] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1880#L13-1 [179] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1876#L13-3 [175] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| 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_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1871#L13-4 [270] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1866#L13-5 [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1867#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1857#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1858#L18 [2020-06-22 11:06:25,512 INFO L796 eck$LassoCheckResult]: Loop: 1858#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1863#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 1859#L18-2 [214] L18-2-->L21: 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] 1860#L21 [121] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1872#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1873#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14] 1881#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 1865#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1861#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1862#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 1882#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1858#L18 [2020-06-22 11:06:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1886455177, now seen corresponding path program 2 times [2020-06-22 11:06:25,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:25,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:25,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1826307016, now seen corresponding path program 1 times [2020-06-22 11:06:25,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:25,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:25,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:06:25,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1973096128, now seen corresponding path program 1 times [2020-06-22 11:06:25,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:25,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:25,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:25,689 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2020-06-22 11:06:26,071 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2020-06-22 11:06:26,211 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-06-22 11:06:26,214 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:06:26,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:06:26,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:06:26,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:06:26,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:06:26,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:06:26,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:06:26,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:06:26,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 11:06:26,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:06:26,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:06:26,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,563 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-06-22 11:06:26,671 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-06-22 11:06:26,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:26,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:27,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:06:27,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:06:27,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:27,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:27,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:27,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:27,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:27,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:27,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:27,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:27,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:27,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:27,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:27,215 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:06:27,225 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:06:27,226 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:06:27,226 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:06:27,227 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:06:27,228 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:06:27,228 INFO L520 LassoAnalysis]: Termination argument consisting of: 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2020-06-22 11:06:27,299 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 11:06:27,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,447 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:27,447 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,456 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,456 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,457 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:27,488 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:27,488 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,498 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,499 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,499 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:06:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,637 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:27,637 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,645 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,645 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,645 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:27,652 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:27,652 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,660 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,661 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,661 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:06:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,702 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 11:06:27,703 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,710 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,710 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,710 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:06:27,742 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:27,743 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,750 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,750 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,750 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2020-06-22 11:06:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:27,821 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:06:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,835 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 11:06:27,836 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,841 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,841 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,842 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:06:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,884 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 11:06:27,885 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,890 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,891 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,891 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:06:27,900 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:27,901 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,908 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,908 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,908 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:27,925 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,935 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,936 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,936 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:27,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:27,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:27,953 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:27,954 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,962 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,963 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,963 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:27,969 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:27,970 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,980 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:27,981 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:27,981 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:06:27,982 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 11:06:27,982 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 11:06:27,982 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 10 Second operand 8 states. [2020-06-22 11:06:28,681 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 326 states and 352 transitions. Complement of second has 114 states. [2020-06-22 11:06:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 4 stem states 16 non-accepting loop states 2 accepting loop states [2020-06-22 11:06:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 11:06:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2020-06-22 11:06:28,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 157 transitions. Stem has 13 letters. Loop has 11 letters. [2020-06-22 11:06:28,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:28,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 157 transitions. Stem has 24 letters. Loop has 11 letters. [2020-06-22 11:06:28,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:28,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 157 transitions. Stem has 13 letters. Loop has 22 letters. [2020-06-22 11:06:28,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:28,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 352 transitions. [2020-06-22 11:06:28,695 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 71 [2020-06-22 11:06:28,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 140 states and 153 transitions. [2020-06-22 11:06:28,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2020-06-22 11:06:28,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2020-06-22 11:06:28,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 153 transitions. [2020-06-22 11:06:28,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:06:28,697 INFO L706 BuchiCegarLoop]: Abstraction has 140 states and 153 transitions. [2020-06-22 11:06:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 153 transitions. [2020-06-22 11:06:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 57. [2020-06-22 11:06:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-06-22 11:06:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2020-06-22 11:06:28,700 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2020-06-22 11:06:28,700 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2020-06-22 11:06:28,700 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 11:06:28,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 66 transitions. [2020-06-22 11:06:28,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 11:06:28,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:28,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:28,701 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:28,701 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:28,702 INFO L794 eck$LassoCheckResult]: Stem: 2768#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 2764#L-1 [237] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2765#L10 [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2760#L10-1 [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 2761#L11 [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 2769#L12 [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 2770#L13 [256] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2771#L13-1 [179] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 2767#L13-3 [175] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| 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_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2759#L13-4 [270] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2756#L13-5 [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 2757#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 2780#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2753#L18 [2020-06-22 11:06:28,703 INFO L796 eck$LassoCheckResult]: Loop: 2753#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2752#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 2748#L18-2 [214] L18-2-->L21: 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] 2749#L21 [121] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2762#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2763#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14] 2772#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 2755#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 2750#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 2751#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 2781#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2753#L18 [2020-06-22 11:06:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1628289739, now seen corresponding path program 1 times [2020-06-22 11:06:28,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:28,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1826307016, now seen corresponding path program 2 times [2020-06-22 11:06:28,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash -167657794, now seen corresponding path program 1 times [2020-06-22 11:06:28,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:28,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:06:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:28,941 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2020-06-22 11:06:29,344 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-06-22 11:06:29,477 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-06-22 11:06:29,481 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:06:29,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:06:29,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:06:29,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:06:29,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:06:29,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:06:29,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:06:29,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:06:29,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 11:06:29,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:06:29,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:06:29,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,804 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2020-06-22 11:06:29,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:29,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:06:30,318 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:06:30,318 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:06:30,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:30,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:30,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:30,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:30,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:30,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:30,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:30,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:30,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:30,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:30,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:30,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:30,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:06:30,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:30,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:30,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:30,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:30,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:30,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:30,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:06:30,385 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 11:06:30,385 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 11:06:30,386 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:06:30,386 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:06:30,387 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:06:30,387 INFO L520 LassoAnalysis]: Termination argument consisting of: 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2020-06-22 11:06:30,488 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 11:06:30,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:30,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 11:06:30,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:30,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:30,539 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 11:06:30,539 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,547 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:30,548 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,548 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2020-06-22 11:06:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:30,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:30,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:30,633 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:30,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,642 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:30,643 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,643 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:30,664 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:30,665 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,673 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:30,673 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,673 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:06:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:30,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:30,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:30,804 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:30,805 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,815 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:30,816 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,816 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:30,821 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,832 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:30,832 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,832 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:06:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:30,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:30,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:30,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 11:06:30,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,883 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:30,883 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,884 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:06:30,908 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:30,908 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,914 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:30,915 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:30,915 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2020-06-22 11:06:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:30,991 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:06:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:30,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:31,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:31,005 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 11:06:31,005 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,012 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:31,013 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,013 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:06:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:31,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:31,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 11:06:31,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,079 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:31,079 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,079 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:06:31,090 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:31,090 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,098 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:31,098 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,098 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:31,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:31,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:31,114 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:31,114 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,122 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:31,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,123 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:31,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:31,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:31,140 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 11:06:31,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,147 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:31,148 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,148 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:06:31,153 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 11:06:31,153 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,161 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:31,161 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:31,161 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:06:31,162 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 11:06:31,162 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 11:06:31,163 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 57 states and 66 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-06-22 11:06:31,610 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 57 states and 66 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 404 states and 438 transitions. Complement of second has 169 states. [2020-06-22 11:06:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 3 stem states 12 non-accepting loop states 1 accepting loop states [2020-06-22 11:06:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 11:06:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. [2020-06-22 11:06:31,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 97 transitions. Stem has 13 letters. Loop has 11 letters. [2020-06-22 11:06:31,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:31,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 97 transitions. Stem has 24 letters. Loop has 11 letters. [2020-06-22 11:06:31,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:31,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 97 transitions. Stem has 13 letters. Loop has 22 letters. [2020-06-22 11:06:31,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:31,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 438 transitions. [2020-06-22 11:06:31,622 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2020-06-22 11:06:31,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 83 states and 90 transitions. [2020-06-22 11:06:31,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2020-06-22 11:06:31,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2020-06-22 11:06:31,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 90 transitions. [2020-06-22 11:06:31,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:06:31,624 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 90 transitions. [2020-06-22 11:06:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 90 transitions. [2020-06-22 11:06:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 29. [2020-06-22 11:06:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 11:06:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-06-22 11:06:31,625 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-06-22 11:06:31,625 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-06-22 11:06:31,626 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 11:06:31,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-06-22 11:06:31,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 11:06:31,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:31,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:31,627 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:31,627 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:31,628 INFO L794 eck$LassoCheckResult]: Stem: 3801#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3798#L-1 [239] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_~c~0.base_1 |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|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_#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~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_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_~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_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_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_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, 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~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 3799#L10 [118] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 3794#L10-1 [170] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 3795#L11 [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, 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_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, 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_11|} AuxVars[] AssignedVars[#memory_int] 3802#L12 [162] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 3803#L13 [256] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 3804#L13-1 [179] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 3800#L13-3 [175] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| 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_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 3793#L13-4 [270] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 3790#L13-5 [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 3791#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 3809#L17-1 [280] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 3808#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 3807#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 3806#L18-2 [107] L18-2-->L19: 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] 3792#L19 [142] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 3788#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 3789#L18-4 [2020-06-22 11:06:31,628 INFO L796 eck$LassoCheckResult]: Loop: 3789#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| 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|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 3785#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 3786#L17-3 [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, 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~mem8] 3781#L17-1 [281] L17-1-->L18: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 3782#L18 [113] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 3787#L18-1 [109] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| 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_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, 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~mem10] 3783#L18-2 [214] L18-2-->L21: 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] 3784#L21 [121] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 3796#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 3797#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14] 3805#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 3789#L18-4 [2020-06-22 11:06:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1499621218, now seen corresponding path program 1 times [2020-06-22 11:06:31,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:31,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:31,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:31,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1284696825, now seen corresponding path program 1 times [2020-06-22 11:06:31,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:31,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:31,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:31,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:31,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:31,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:31,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 11:06:31,671 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:06:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 11:06:31,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 11:06:31,671 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-06-22 11:06:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:31,755 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-06-22 11:06:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 11:06:31,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2020-06-22 11:06:31,761 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:06:31,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2020-06-22 11:06:31,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 11:06:31,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 11:06:31,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 11:06:31,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:06:31,762 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:31,762 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:31,762 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:31,762 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 11:06:31,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:06:31,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:06:31,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 11:06:31,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:06:31 BasicIcfg [2020-06-22 11:06:31,769 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 11:06:31,769 INFO L168 Benchmark]: Toolchain (without parser) took 19359.05 ms. Allocated memory was 514.9 MB in the beginning and 818.4 MB in the end (delta: 303.6 MB). Free memory was 439.6 MB in the beginning and 555.4 MB in the end (delta: -115.8 MB). Peak memory consumption was 187.8 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,770 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 11:06:31,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.92 ms. Allocated memory was 514.9 MB in the beginning and 554.2 MB in the end (delta: 39.3 MB). Free memory was 439.6 MB in the beginning and 521.8 MB in the end (delta: -82.2 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.78 ms. Allocated memory is still 554.2 MB. Free memory was 521.1 MB in the beginning and 519.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,771 INFO L168 Benchmark]: Boogie Preprocessor took 25.48 ms. Allocated memory is still 554.2 MB. Free memory was 519.0 MB in the beginning and 517.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,771 INFO L168 Benchmark]: RCFGBuilder took 446.46 ms. Allocated memory is still 554.2 MB. Free memory was 517.7 MB in the beginning and 489.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,772 INFO L168 Benchmark]: BlockEncodingV2 took 143.02 ms. Allocated memory is still 554.2 MB. Free memory was 488.8 MB in the beginning and 476.0 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,772 INFO L168 Benchmark]: TraceAbstraction took 1757.63 ms. Allocated memory was 554.2 MB in the beginning and 587.2 MB in the end (delta: 33.0 MB). Free memory was 475.3 MB in the beginning and 423.5 MB in the end (delta: 51.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,773 INFO L168 Benchmark]: BuchiAutomizer took 16642.57 ms. Allocated memory was 587.2 MB in the beginning and 818.4 MB in the end (delta: 231.2 MB). Free memory was 423.5 MB in the beginning and 555.4 MB in the end (delta: -131.8 MB). Peak memory consumption was 99.4 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:31,776 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 76 locations, 81 edges - StatisticsResult: Encoded RCFG 66 locations, 116 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 293.92 ms. Allocated memory was 514.9 MB in the beginning and 554.2 MB in the end (delta: 39.3 MB). Free memory was 439.6 MB in the beginning and 521.8 MB in the end (delta: -82.2 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.78 ms. Allocated memory is still 554.2 MB. Free memory was 521.1 MB in the beginning and 519.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.48 ms. Allocated memory is still 554.2 MB. Free memory was 519.0 MB in the beginning and 517.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 446.46 ms. Allocated memory is still 554.2 MB. Free memory was 517.7 MB in the beginning and 489.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 143.02 ms. Allocated memory is still 554.2 MB. Free memory was 488.8 MB in the beginning and 476.0 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1757.63 ms. Allocated memory was 554.2 MB in the beginning and 587.2 MB in the end (delta: 33.0 MB). Free memory was 475.3 MB in the beginning and 423.5 MB in the end (delta: 51.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 16642.57 ms. Allocated memory was 587.2 MB in the beginning and 818.4 MB in the end (delta: 231.2 MB). Free memory was 423.5 MB in the beginning and 555.4 MB in the end (delta: -131.8 MB). Peak memory consumption was 99.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 38 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-06-22 11:06:31,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:31,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:31,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:31,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:31,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:31,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 38 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 471 SDslu, 6 SDs, 0 SdLazy, 470 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 63 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 22 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 16 locations. 5 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 8.7s. Construction of modules took 2.1s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 491 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 68 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 193 SDtfs, 606 SDslu, 666 SDs, 0 SdLazy, 2725 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital322 mio100 ax100 hnf100 lsp97 ukn59 mio100 lsp36 div100 bol100 ite100 ukn100 eq189 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 11:06:08.885 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 11:06:32.012 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check