./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:31:51,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:31:51,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:31:52,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:31:52,001 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:31:52,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:31:52,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:31:52,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:31:52,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:31:52,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:31:52,005 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:31:52,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:31:52,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:31:52,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:31:52,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:31:52,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:31:52,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:31:52,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:31:52,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:31:52,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:31:52,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:31:52,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:31:52,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:31:52,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:31:52,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:31:52,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:31:52,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:31:52,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:31:52,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:31:52,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:31:52,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:31:52,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:31:52,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:31:52,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:31:52,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:31:52,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:31:52,019 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:31:52,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:31:52,027 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:31:52,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:31:52,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:31:52,028 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:31:52,028 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:31:52,028 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:31:52,029 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:31:52,029 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:31:52,029 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:31:52,029 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:31:52,029 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:31:52,029 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:31:52,029 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:31:52,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:31:52,030 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:31:52,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:31:52,030 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:31:52,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:31:52,030 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:31:52,030 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:31:52,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:31:52,031 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:31:52,031 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:31:52,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:31:52,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:31:52,031 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:31:52,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:31:52,031 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:31:52,032 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:31:52,032 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:31:52,032 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2018-11-10 07:31:52,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:31:52,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:31:52,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:31:52,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:31:52,069 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:31:52,069 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-10 07:31:52,114 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/data/f613674c6/a9325d2003784c2795ecd1ce6c25c5e2/FLAG75e9a92b9 [2018-11-10 07:31:52,410 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:31:52,411 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-10 07:31:52,414 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/data/f613674c6/a9325d2003784c2795ecd1ce6c25c5e2/FLAG75e9a92b9 [2018-11-10 07:31:52,424 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/data/f613674c6/a9325d2003784c2795ecd1ce6c25c5e2 [2018-11-10 07:31:52,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:31:52,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:31:52,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:31:52,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:31:52,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:31:52,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52, skipping insertion in model container [2018-11-10 07:31:52,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:31:52,457 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:31:52,562 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:31:52,567 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:31:52,581 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:31:52,591 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:31:52,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52 WrapperNode [2018-11-10 07:31:52,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:31:52,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:31:52,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:31:52,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:31:52,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:31:52,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:31:52,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:31:52,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:31:52,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... [2018-11-10 07:31:52,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:31:52,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:31:52,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:31:52,645 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:31:52,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:31:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:31:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:31:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:31:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:31:52,960 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:31:52,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:31:52 BoogieIcfgContainer [2018-11-10 07:31:52,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:31:52,961 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:31:52,961 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:31:52,964 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:31:52,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:31:52,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:31:52" (1/3) ... [2018-11-10 07:31:52,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aca7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:31:52, skipping insertion in model container [2018-11-10 07:31:52,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:31:52,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:52" (2/3) ... [2018-11-10 07:31:52,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aca7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:31:52, skipping insertion in model container [2018-11-10 07:31:52,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:31:52,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:31:52" (3/3) ... [2018-11-10 07:31:52,967 INFO L375 chiAutomizerObserver]: Analyzing ICFG max05_true-unreach-call_true-termination.i [2018-11-10 07:31:53,010 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:31:53,010 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:31:53,010 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:31:53,011 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:31:53,011 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:31:53,011 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:31:53,011 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:31:53,011 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:31:53,011 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:31:53,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-10 07:31:53,034 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2018-11-10 07:31:53,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:53,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:53,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:31:53,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:31:53,038 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:31:53,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-10 07:31:53,041 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2018-11-10 07:31:53,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:53,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:53,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:31:53,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:31:53,046 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 18#L23-4true [2018-11-10 07:31:53,046 INFO L795 eck$LassoCheckResult]: Loop: 18#L23-4true assume true; 41#L23-1true assume !!(main_~i~1 < 5); 59#L24true SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 57#L24-1true havoc main_#t~nondet5; 21#L23-3true main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 18#L23-4true [2018-11-10 07:31:53,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 07:31:53,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:53,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:53,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:53,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 07:31:53,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:53,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:53,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:53,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:53,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 07:31:53,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:53,280 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:31:53,281 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:31:53,281 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:31:53,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:31:53,282 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:31:53,282 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:31:53,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:31:53,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:31:53,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 07:31:53,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:31:53,283 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:31:53,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:53,646 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:31:53,650 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:31:53,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:53,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:53,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:53,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:53,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:31:53,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:31:53,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:31:53,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:53,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:53,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:53,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:53,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:53,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:53,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:53,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:53,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:53,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:53,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:53,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:53,753 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:31:53,784 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 07:31:53,784 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 07:31:53,786 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:31:53,788 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:31:53,788 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:31:53,788 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2018-11-10 07:31:53,800 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 07:31:53,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:31:53,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:53,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:53,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:53,884 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 07:31:53,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states. Second operand 5 states. [2018-11-10 07:31:53,980 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states.. Second operand 5 states. Result 168 states and 201 transitions. Complement of second has 10 states. [2018-11-10 07:31:53,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 07:31:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:31:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2018-11-10 07:31:53,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 07:31:53,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:31:53,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 07:31:53,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:31:53,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 07:31:53,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:31:53,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 201 transitions. [2018-11-10 07:31:53,989 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:53,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 55 states and 63 transitions. [2018-11-10 07:31:53,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 07:31:53,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 07:31:53,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-10 07:31:53,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:53,994 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-10 07:31:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-10 07:31:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 07:31:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 07:31:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-10 07:31:54,012 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-10 07:31:54,012 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-10 07:31:54,012 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:31:54,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 63 transitions. [2018-11-10 07:31:54,013 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:54,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:54,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 07:31:54,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:54,014 INFO L793 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 299#L23-4 assume true; 315#L23-1 assume !(main_~i~1 < 5); 312#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 313#L9-4 [2018-11-10 07:31:54,014 INFO L795 eck$LassoCheckResult]: Loop: 313#L9-4 assume true; 324#L9-1 assume !!(max_~i~0 < 5); 303#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 304#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 339#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 327#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 313#L9-4 [2018-11-10 07:31:54,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 28694797, now seen corresponding path program 1 times [2018-11-10 07:31:54,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:54,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:31:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:31:54,042 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:54,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 1 times [2018-11-10 07:31:54,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:54,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:31:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:31:54,089 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-10 07:31:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:54,101 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-10 07:31:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:31:54,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 67 transitions. [2018-11-10 07:31:54,104 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 66 transitions. [2018-11-10 07:31:54,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 07:31:54,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 07:31:54,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 66 transitions. [2018-11-10 07:31:54,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:54,106 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-10 07:31:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 66 transitions. [2018-11-10 07:31:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-10 07:31:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 07:31:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-10 07:31:54,109 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-10 07:31:54,109 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-10 07:31:54,109 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:31:54,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 62 transitions. [2018-11-10 07:31:54,110 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:54,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:54,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:54,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:54,111 INFO L793 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 423#L23-4 assume true; 435#L23-1 assume !!(main_~i~1 < 5); 457#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 466#L24-1 havoc main_#t~nondet5; 440#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 436#L23-4 assume true; 437#L23-1 assume !(main_~i~1 < 5); 433#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 434#L9-4 [2018-11-10 07:31:54,111 INFO L795 eck$LassoCheckResult]: Loop: 434#L9-4 assume true; 445#L9-1 assume !!(max_~i~0 < 5); 424#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 425#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 460#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 448#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 434#L9-4 [2018-11-10 07:31:54,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2016318454, now seen corresponding path program 1 times [2018-11-10 07:31:54,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:54,139 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/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 [2018-11-10 07:31:54,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:54,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 07:31:54,201 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:54,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 2 times [2018-11-10 07:31:54,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:31:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:31:54,241 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-10 07:31:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:54,261 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-10 07:31:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:31:54,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 72 transitions. [2018-11-10 07:31:54,264 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 71 transitions. [2018-11-10 07:31:54,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 07:31:54,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 07:31:54,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 71 transitions. [2018-11-10 07:31:54,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:54,266 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-11-10 07:31:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 71 transitions. [2018-11-10 07:31:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-11-10 07:31:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 07:31:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-10 07:31:54,269 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-10 07:31:54,269 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-10 07:31:54,269 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:31:54,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 67 transitions. [2018-11-10 07:31:54,271 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:54,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:54,272 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 07:31:54,272 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:54,272 INFO L793 eck$LassoCheckResult]: Stem: 599#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 577#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 578#L23-4 assume true; 590#L23-1 assume !!(main_~i~1 < 5); 628#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 627#L24-1 havoc main_#t~nondet5; 595#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 591#L23-4 assume true; 592#L23-1 assume !!(main_~i~1 < 5); 613#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 622#L24-1 havoc main_#t~nondet5; 623#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 626#L23-4 assume true; 612#L23-1 assume !(main_~i~1 < 5); 588#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 589#L9-4 [2018-11-10 07:31:54,272 INFO L795 eck$LassoCheckResult]: Loop: 589#L9-4 assume true; 600#L9-1 assume !!(max_~i~0 < 5); 579#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 580#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 616#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 603#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 589#L9-4 [2018-11-10 07:31:54,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1843081005, now seen corresponding path program 2 times [2018-11-10 07:31:54,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:54,300 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/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 [2018-11-10 07:31:54,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:31:54,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:31:54,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:31:54,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:54,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 07:31:54,342 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:54,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 3 times [2018-11-10 07:31:54,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:31:54,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:31:54,405 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 07:31:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:54,428 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-11-10 07:31:54,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:31:54,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 77 transitions. [2018-11-10 07:31:54,432 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 76 transitions. [2018-11-10 07:31:54,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 07:31:54,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 07:31:54,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 76 transitions. [2018-11-10 07:31:54,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:54,433 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-11-10 07:31:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 76 transitions. [2018-11-10 07:31:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-10 07:31:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 07:31:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-10 07:31:54,437 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-10 07:31:54,437 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-10 07:31:54,437 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:31:54,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 72 transitions. [2018-11-10 07:31:54,438 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:54,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:54,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-10 07:31:54,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:54,439 INFO L793 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 755#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 756#L23-4 assume true; 771#L23-1 assume !!(main_~i~1 < 5); 814#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 813#L24-1 havoc main_#t~nondet5; 812#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 772#L23-4 assume true; 773#L23-1 assume !!(main_~i~1 < 5); 795#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 804#L24-1 havoc main_#t~nondet5; 776#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 777#L23-4 assume true; 808#L23-1 assume !!(main_~i~1 < 5); 811#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 810#L24-1 havoc main_#t~nondet5; 809#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 807#L23-4 assume true; 794#L23-1 assume !(main_~i~1 < 5); 769#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 770#L9-4 [2018-11-10 07:31:54,439 INFO L795 eck$LassoCheckResult]: Loop: 770#L9-4 assume true; 782#L9-1 assume !!(max_~i~0 < 5); 760#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 761#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 798#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 785#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 770#L9-4 [2018-11-10 07:31:54,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash -500373014, now seen corresponding path program 3 times [2018-11-10 07:31:54,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:54,474 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:31:54,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:31:54,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 07:31:54,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:31:54,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:54,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 07:31:54,538 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:54,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 4 times [2018-11-10 07:31:54,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:31:54,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:31:54,592 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 07:31:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:54,612 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-10 07:31:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:31:54,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 82 transitions. [2018-11-10 07:31:54,614 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 81 transitions. [2018-11-10 07:31:54,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 07:31:54,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 07:31:54,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 81 transitions. [2018-11-10 07:31:54,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:54,615 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-10 07:31:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 81 transitions. [2018-11-10 07:31:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-10 07:31:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 07:31:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-10 07:31:54,619 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-10 07:31:54,619 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-10 07:31:54,619 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:31:54,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 77 transitions. [2018-11-10 07:31:54,620 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:54,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:54,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-11-10 07:31:54,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:54,621 INFO L793 eck$LassoCheckResult]: Stem: 988#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 966#L23-4 assume true; 978#L23-1 assume !!(main_~i~1 < 5); 1026#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1025#L24-1 havoc main_#t~nondet5; 1024#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 979#L23-4 assume true; 980#L23-1 assume !!(main_~i~1 < 5); 1002#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1011#L24-1 havoc main_#t~nondet5; 983#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 984#L23-4 assume true; 1023#L23-1 assume !!(main_~i~1 < 5); 1022#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1021#L24-1 havoc main_#t~nondet5; 1020#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1019#L23-4 assume true; 1015#L23-1 assume !!(main_~i~1 < 5); 1018#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1017#L24-1 havoc main_#t~nondet5; 1016#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1014#L23-4 assume true; 1001#L23-1 assume !(main_~i~1 < 5); 976#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 977#L9-4 [2018-11-10 07:31:54,621 INFO L795 eck$LassoCheckResult]: Loop: 977#L9-4 assume true; 989#L9-1 assume !!(max_~i~0 < 5); 967#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 968#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1005#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 992#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 977#L9-4 [2018-11-10 07:31:54,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 543382861, now seen corresponding path program 4 times [2018-11-10 07:31:54,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:54,653 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:31:54,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:31:54,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:31:54,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:31:54,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:54,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:54,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 07:31:54,718 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:54,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 5 times [2018-11-10 07:31:54,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:31:54,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:31:54,744 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-10 07:31:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:54,761 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-10 07:31:54,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:31:54,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 84 transitions. [2018-11-10 07:31:54,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 76 states and 83 transitions. [2018-11-10 07:31:54,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 07:31:54,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 07:31:54,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 83 transitions. [2018-11-10 07:31:54,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:54,763 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-11-10 07:31:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 83 transitions. [2018-11-10 07:31:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-10 07:31:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 07:31:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-10 07:31:54,768 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-10 07:31:54,768 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-10 07:31:54,768 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:31:54,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 82 transitions. [2018-11-10 07:31:54,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 07:31:54,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:54,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:54,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1] [2018-11-10 07:31:54,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:54,770 INFO L793 eck$LassoCheckResult]: Stem: 1218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1195#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1196#L23-4 assume true; 1208#L23-1 assume !!(main_~i~1 < 5); 1261#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1260#L24-1 havoc main_#t~nondet5; 1259#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1209#L23-4 assume true; 1210#L23-1 assume !!(main_~i~1 < 5); 1232#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1241#L24-1 havoc main_#t~nondet5; 1213#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1214#L23-4 assume true; 1258#L23-1 assume !!(main_~i~1 < 5); 1257#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1256#L24-1 havoc main_#t~nondet5; 1255#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1254#L23-4 assume true; 1253#L23-1 assume !!(main_~i~1 < 5); 1252#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1251#L24-1 havoc main_#t~nondet5; 1250#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1249#L23-4 assume true; 1245#L23-1 assume !!(main_~i~1 < 5); 1248#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1247#L24-1 havoc main_#t~nondet5; 1246#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1244#L23-4 assume true; 1231#L23-1 assume !(main_~i~1 < 5); 1206#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1207#L9-4 [2018-11-10 07:31:54,770 INFO L795 eck$LassoCheckResult]: Loop: 1207#L9-4 assume true; 1219#L9-1 assume !!(max_~i~0 < 5); 1197#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 1198#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1235#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1222#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1207#L9-4 [2018-11-10 07:31:54,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash 975998922, now seen corresponding path program 5 times [2018-11-10 07:31:54,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 6 times [2018-11-10 07:31:54,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1791480664, now seen corresponding path program 1 times [2018-11-10 07:31:54,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:54,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:54,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:54,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:55,162 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2018-11-10 07:31:55,234 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:31:55,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:31:55,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:31:55,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:31:55,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:31:55,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:31:55,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:31:55,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:31:55,235 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-10 07:31:55,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:31:55,235 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:31:55,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:31:55,603 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:31:55,603 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:31:55,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:55,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:55,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:55,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:55,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:55,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:55,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:55,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:55,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:55,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:55,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:55,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:55,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:55,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:55,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:55,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:55,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:55,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:55,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:55,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:55,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:55,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:55,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:55,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:55,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:55,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:55,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:55,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:55,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:55,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:55,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:55,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:31:55,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:31:55,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:31:55,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:31:55,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:31:55,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:31:55,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:31:55,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:31:55,639 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:31:55,652 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:31:55,653 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 07:31:55,653 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:31:55,654 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:31:55,654 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:31:55,654 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2018-11-10 07:31:55,687 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 07:31:55,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:55,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:55,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:31:55,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:31:55,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 82 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 07:31:55,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 82 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 92 states and 101 transitions. Complement of second has 7 states. [2018-11-10 07:31:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:31:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:31:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-10 07:31:55,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 30 letters. Loop has 6 letters. [2018-11-10 07:31:55,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:31:55,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 36 letters. Loop has 6 letters. [2018-11-10 07:31:55,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:31:55,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 30 letters. Loop has 12 letters. [2018-11-10 07:31:55,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:31:55,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 101 transitions. [2018-11-10 07:31:55,776 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:55,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 77 states and 85 transitions. [2018-11-10 07:31:55,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 07:31:55,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 07:31:55,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 85 transitions. [2018-11-10 07:31:55,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:55,777 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-10 07:31:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 85 transitions. [2018-11-10 07:31:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-10 07:31:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:31:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-10 07:31:55,780 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-10 07:31:55,780 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-10 07:31:55,780 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:31:55,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 85 transitions. [2018-11-10 07:31:55,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:55,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:55,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:55,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:55,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:55,782 INFO L793 eck$LassoCheckResult]: Stem: 1536#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1514#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1515#L23-4 assume true; 1527#L23-1 assume !!(main_~i~1 < 5); 1582#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1581#L24-1 havoc main_#t~nondet5; 1532#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1528#L23-4 assume true; 1529#L23-1 assume !!(main_~i~1 < 5); 1552#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1561#L24-1 havoc main_#t~nondet5; 1562#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1580#L23-4 assume true; 1579#L23-1 assume !!(main_~i~1 < 5); 1578#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1577#L24-1 havoc main_#t~nondet5; 1576#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1575#L23-4 assume true; 1574#L23-1 assume !!(main_~i~1 < 5); 1573#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1572#L24-1 havoc main_#t~nondet5; 1571#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1570#L23-4 assume true; 1566#L23-1 assume !!(main_~i~1 < 5); 1569#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1568#L24-1 havoc main_#t~nondet5; 1567#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1565#L23-4 assume true; 1551#L23-1 assume !(main_~i~1 < 5); 1525#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1526#L9-4 assume true; 1537#L9-1 assume !(max_~i~0 < 5); 1545#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1553#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 1510#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1509#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 1508#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1506#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1507#L29-4 havoc main_#t~mem8; 1520#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1518#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1519#L9-10 [2018-11-10 07:31:55,782 INFO L795 eck$LassoCheckResult]: Loop: 1519#L9-10 assume true; 1548#L9-7 assume !!(max_~i~0 < 5); 1554#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 1564#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1559#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1549#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1519#L9-10 [2018-11-10 07:31:55,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1592607325, now seen corresponding path program 1 times [2018-11-10 07:31:55,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:55,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:55,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 07:31:55,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:31:55,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:31:55,809 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:55,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1716397297, now seen corresponding path program 1 times [2018-11-10 07:31:55,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:55,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:55,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:31:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:31:55,852 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-10 07:31:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:55,878 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-10 07:31:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:31:55,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 111 transitions. [2018-11-10 07:31:55,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:55,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 100 states and 110 transitions. [2018-11-10 07:31:55,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 07:31:55,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-10 07:31:55,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 110 transitions. [2018-11-10 07:31:55,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:55,880 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-10 07:31:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 110 transitions. [2018-11-10 07:31:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-11-10 07:31:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 07:31:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-10 07:31:55,885 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-10 07:31:55,885 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-10 07:31:55,885 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:31:55,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 86 transitions. [2018-11-10 07:31:55,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:55,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:55,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:55,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:55,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:55,887 INFO L793 eck$LassoCheckResult]: Stem: 1719#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1696#L23-4 assume true; 1711#L23-1 assume !!(main_~i~1 < 5); 1737#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1747#L24-1 havoc main_#t~nondet5; 1716#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1712#L23-4 assume true; 1713#L23-1 assume !!(main_~i~1 < 5); 1768#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1767#L24-1 havoc main_#t~nondet5; 1766#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1765#L23-4 assume true; 1764#L23-1 assume !!(main_~i~1 < 5); 1763#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1762#L24-1 havoc main_#t~nondet5; 1761#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1760#L23-4 assume true; 1759#L23-1 assume !!(main_~i~1 < 5); 1758#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1757#L24-1 havoc main_#t~nondet5; 1756#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1755#L23-4 assume true; 1751#L23-1 assume !!(main_~i~1 < 5); 1754#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1753#L24-1 havoc main_#t~nondet5; 1752#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1750#L23-4 assume true; 1736#L23-1 assume !(main_~i~1 < 5); 1709#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1710#L9-4 assume true; 1721#L9-1 assume !!(max_~i~0 < 5); 1700#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 1701#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1741#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1726#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1722#L9-4 assume true; 1723#L9-1 assume !(max_~i~0 < 5); 1729#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1738#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 1694#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1693#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 1692#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1690#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1691#L29-4 havoc main_#t~mem8; 1704#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1702#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1703#L9-10 assume true; 1739#L9-7 assume !!(max_~i~0 < 5); 1740#L10-6 [2018-11-10 07:31:55,887 INFO L795 eck$LassoCheckResult]: Loop: 1740#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 1749#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1745#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1734#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1732#L9-10 assume true; 1733#L9-7 assume !!(max_~i~0 < 5); 1740#L10-6 [2018-11-10 07:31:55,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash -546743494, now seen corresponding path program 1 times [2018-11-10 07:31:55,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:55,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:55,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 07:31:55,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:55,935 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:31:55,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:55,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 07:31:55,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:55,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 07:31:55,998 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:55,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 2 times [2018-11-10 07:31:55,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:31:56,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:31:56,036 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-10 07:31:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:56,070 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-11-10 07:31:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:31:56,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 138 transitions. [2018-11-10 07:31:56,072 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 124 states and 137 transitions. [2018-11-10 07:31:56,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-11-10 07:31:56,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-10 07:31:56,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 137 transitions. [2018-11-10 07:31:56,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:56,073 INFO L705 BuchiCegarLoop]: Abstraction has 124 states and 137 transitions. [2018-11-10 07:31:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 137 transitions. [2018-11-10 07:31:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2018-11-10 07:31:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 07:31:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-11-10 07:31:56,076 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-11-10 07:31:56,076 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-11-10 07:31:56,076 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:31:56,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 104 transitions. [2018-11-10 07:31:56,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:56,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:56,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,078 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,078 INFO L793 eck$LassoCheckResult]: Stem: 2076#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2051#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2052#L23-4 assume true; 2067#L23-1 assume !!(main_~i~1 < 5); 2095#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2105#L24-1 havoc main_#t~nondet5; 2106#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2068#L23-4 assume true; 2069#L23-1 assume !!(main_~i~1 < 5); 2135#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2134#L24-1 havoc main_#t~nondet5; 2072#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2073#L23-4 assume true; 2133#L23-1 assume !!(main_~i~1 < 5); 2132#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2131#L24-1 havoc main_#t~nondet5; 2129#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2127#L23-4 assume true; 2123#L23-1 assume !!(main_~i~1 < 5); 2121#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2120#L24-1 havoc main_#t~nondet5; 2118#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2116#L23-4 assume true; 2111#L23-1 assume !!(main_~i~1 < 5); 2115#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2113#L24-1 havoc main_#t~nondet5; 2112#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2110#L23-4 assume true; 2094#L23-1 assume !(main_~i~1 < 5); 2065#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2066#L9-4 assume true; 2078#L9-1 assume !!(max_~i~0 < 5); 2056#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2057#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2098#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2083#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2079#L9-4 assume true; 2080#L9-1 assume !!(max_~i~0 < 5); 2140#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2138#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2136#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2119#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2117#L9-4 assume true; 2086#L9-1 assume !(max_~i~0 < 5); 2087#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2096#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 2050#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 2049#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 2048#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 2046#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 2047#L29-4 havoc main_#t~mem8; 2060#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 2058#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2059#L9-10 assume true; 2130#L9-7 assume !!(max_~i~0 < 5); 2128#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 2125#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2122#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2092#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2090#L9-10 assume true; 2091#L9-7 assume !!(max_~i~0 < 5); 2097#L10-6 [2018-11-10 07:31:56,079 INFO L795 eck$LassoCheckResult]: Loop: 2097#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 2108#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2102#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2103#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2114#L9-10 assume true; 2109#L9-7 assume !!(max_~i~0 < 5); 2097#L10-6 [2018-11-10 07:31:56,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash 980571130, now seen corresponding path program 1 times [2018-11-10 07:31:56,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 07:31:56,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:56,123 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:31:56,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:56,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 07:31:56,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:56,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 07:31:56,192 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:56,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 3 times [2018-11-10 07:31:56,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:31:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:31:56,234 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-10 07:31:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:56,282 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2018-11-10 07:31:56,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:31:56,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 165 transitions. [2018-11-10 07:31:56,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 148 states and 164 transitions. [2018-11-10 07:31:56,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-11-10 07:31:56,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-10 07:31:56,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 164 transitions. [2018-11-10 07:31:56,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:56,285 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-11-10 07:31:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 164 transitions. [2018-11-10 07:31:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 111. [2018-11-10 07:31:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 07:31:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-11-10 07:31:56,288 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-11-10 07:31:56,288 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-11-10 07:31:56,288 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:31:56,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 122 transitions. [2018-11-10 07:31:56,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:56,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:56,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,290 INFO L793 eck$LassoCheckResult]: Stem: 2508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2484#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2485#L23-4 assume true; 2500#L23-1 assume !!(main_~i~1 < 5); 2528#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2541#L24-1 havoc main_#t~nondet5; 2505#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2501#L23-4 assume true; 2502#L23-1 assume !!(main_~i~1 < 5); 2571#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2570#L24-1 havoc main_#t~nondet5; 2569#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2568#L23-4 assume true; 2567#L23-1 assume !!(main_~i~1 < 5); 2566#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2565#L24-1 havoc main_#t~nondet5; 2564#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2563#L23-4 assume true; 2562#L23-1 assume !!(main_~i~1 < 5); 2561#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2560#L24-1 havoc main_#t~nondet5; 2558#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2555#L23-4 assume true; 2549#L23-1 assume !!(main_~i~1 < 5); 2553#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2551#L24-1 havoc main_#t~nondet5; 2550#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2548#L23-4 assume true; 2527#L23-1 assume !(main_~i~1 < 5); 2498#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2499#L9-4 assume true; 2510#L9-1 assume !!(max_~i~0 < 5); 2587#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2537#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2532#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2533#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2511#L9-4 assume true; 2512#L9-1 assume !!(max_~i~0 < 5); 2489#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2490#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2584#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2515#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2516#L9-4 assume true; 2557#L9-1 assume !!(max_~i~0 < 5); 2583#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2578#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2573#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2559#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2556#L9-4 assume true; 2519#L9-1 assume !(max_~i~0 < 5); 2520#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2529#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 2483#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 2482#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 2481#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 2479#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 2480#L29-4 havoc main_#t~mem8; 2493#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 2491#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2492#L9-10 assume true; 2523#L9-7 assume !!(max_~i~0 < 5); 2589#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 2588#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2538#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2524#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2525#L9-10 assume true; 2530#L9-7 assume !!(max_~i~0 < 5); 2531#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 2544#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2540#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2582#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2581#L9-10 assume true; 2580#L9-7 assume !!(max_~i~0 < 5); 2547#L10-6 [2018-11-10 07:31:56,290 INFO L795 eck$LassoCheckResult]: Loop: 2547#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 2575#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2572#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2554#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2552#L9-10 assume true; 2546#L9-7 assume !!(max_~i~0 < 5); 2547#L10-6 [2018-11-10 07:31:56,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,290 INFO L82 PathProgramCache]: Analyzing trace with hash 428933562, now seen corresponding path program 2 times [2018-11-10 07:31:56,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 07:31:56,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:56,327 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:31:56,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:31:56,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:31:56,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:31:56,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 07:31:56,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:56,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 07:31:56,411 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:56,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 4 times [2018-11-10 07:31:56,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:31:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:31:56,447 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-10 07:31:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:56,506 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-11-10 07:31:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:31:56,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 192 transitions. [2018-11-10 07:31:56,507 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 172 states and 191 transitions. [2018-11-10 07:31:56,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2018-11-10 07:31:56,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2018-11-10 07:31:56,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 191 transitions. [2018-11-10 07:31:56,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:56,508 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 191 transitions. [2018-11-10 07:31:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 191 transitions. [2018-11-10 07:31:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 127. [2018-11-10 07:31:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 07:31:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-11-10 07:31:56,510 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-11-10 07:31:56,510 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-11-10 07:31:56,510 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:31:56,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 140 transitions. [2018-11-10 07:31:56,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:56,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:56,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,511 INFO L793 eck$LassoCheckResult]: Stem: 3018#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2995#L23-4 assume true; 3010#L23-1 assume !!(main_~i~1 < 5); 3037#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3049#L24-1 havoc main_#t~nondet5; 3015#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3011#L23-4 assume true; 3012#L23-1 assume !!(main_~i~1 < 5); 3077#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3076#L24-1 havoc main_#t~nondet5; 3075#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3074#L23-4 assume true; 3073#L23-1 assume !!(main_~i~1 < 5); 3072#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3071#L24-1 havoc main_#t~nondet5; 3070#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3069#L23-4 assume true; 3068#L23-1 assume !!(main_~i~1 < 5); 3067#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3066#L24-1 havoc main_#t~nondet5; 3064#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3061#L23-4 assume true; 3055#L23-1 assume !!(main_~i~1 < 5); 3059#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3057#L24-1 havoc main_#t~nondet5; 3056#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3054#L23-4 assume true; 3036#L23-1 assume !(main_~i~1 < 5); 3008#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3009#L9-4 assume true; 3020#L9-1 assume !!(max_~i~0 < 5); 2999#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3000#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3040#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3025#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3021#L9-4 assume true; 3022#L9-1 assume !!(max_~i~0 < 5); 3115#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3114#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3113#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3112#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3111#L9-4 assume true; 3110#L9-1 assume !!(max_~i~0 < 5); 3109#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3107#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3105#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3104#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3103#L9-4 assume true; 3063#L9-1 assume !!(max_~i~0 < 5); 3086#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3084#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3079#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3065#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3062#L9-4 assume true; 3028#L9-1 assume !(max_~i~0 < 5); 3029#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3038#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 2993#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 2992#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 2991#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 2989#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 2990#L29-4 havoc main_#t~mem8; 3003#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3001#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3002#L9-10 assume true; 3102#L9-7 assume !!(max_~i~0 < 5); 3101#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3099#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3097#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3034#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3032#L9-10 assume true; 3033#L9-7 assume !!(max_~i~0 < 5); 3039#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3051#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3046#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3047#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3096#L9-10 assume true; 3095#L9-7 assume !!(max_~i~0 < 5); 3094#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3092#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3090#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3089#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3088#L9-10 assume true; 3087#L9-7 assume !!(max_~i~0 < 5); 3053#L10-6 [2018-11-10 07:31:56,511 INFO L795 eck$LassoCheckResult]: Loop: 3053#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3081#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3078#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3060#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3058#L9-10 assume true; 3052#L9-7 assume !!(max_~i~0 < 5); 3053#L10-6 [2018-11-10 07:31:56,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2060835718, now seen corresponding path program 3 times [2018-11-10 07:31:56,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 07:31:56,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:56,566 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:31:56,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:31:56,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 07:31:56,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:31:56,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 07:31:56,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:31:56,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 07:31:56,652 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:31:56,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 5 times [2018-11-10 07:31:56,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:31:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:31:56,716 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-10 07:31:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:56,783 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2018-11-10 07:31:56,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:31:56,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 198 transitions. [2018-11-10 07:31:56,785 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 178 states and 197 transitions. [2018-11-10 07:31:56,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2018-11-10 07:31:56,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2018-11-10 07:31:56,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 197 transitions. [2018-11-10 07:31:56,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:56,787 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 197 transitions. [2018-11-10 07:31:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 197 transitions. [2018-11-10 07:31:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 143. [2018-11-10 07:31:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 07:31:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2018-11-10 07:31:56,789 INFO L728 BuchiCegarLoop]: Abstraction has 143 states and 158 transitions. [2018-11-10 07:31:56,789 INFO L608 BuchiCegarLoop]: Abstraction has 143 states and 158 transitions. [2018-11-10 07:31:56,789 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:31:56,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 158 transitions. [2018-11-10 07:31:56,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 07:31:56,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:56,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:56,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:56,798 INFO L793 eck$LassoCheckResult]: Stem: 3587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3564#L23-4 assume true; 3579#L23-1 assume !!(main_~i~1 < 5); 3668#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3622#L24-1 havoc main_#t~nondet5; 3584#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3580#L23-4 assume true; 3581#L23-1 assume !!(main_~i~1 < 5); 3608#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3625#L24-1 havoc main_#t~nondet5; 3663#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3661#L23-4 assume true; 3659#L23-1 assume !!(main_~i~1 < 5); 3657#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3655#L24-1 havoc main_#t~nondet5; 3651#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3649#L23-4 assume true; 3647#L23-1 assume !!(main_~i~1 < 5); 3645#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3643#L24-1 havoc main_#t~nondet5; 3642#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3638#L23-4 assume true; 3631#L23-1 assume !!(main_~i~1 < 5); 3635#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3633#L24-1 havoc main_#t~nondet5; 3632#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3630#L23-4 assume true; 3607#L23-1 assume !(main_~i~1 < 5); 3577#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3578#L9-4 assume true; 3589#L9-1 assume !!(max_~i~0 < 5); 3600#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3700#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3611#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3612#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3590#L9-4 assume true; 3591#L9-1 assume !!(max_~i~0 < 5); 3568#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3569#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3615#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3594#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3595#L9-4 assume true; 3699#L9-1 assume !!(max_~i~0 < 5); 3698#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3696#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3694#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3693#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3692#L9-4 assume true; 3691#L9-1 assume !!(max_~i~0 < 5); 3690#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3688#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3686#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3685#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3684#L9-4 assume true; 3673#L9-1 assume !!(max_~i~0 < 5); 3683#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3678#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3675#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3674#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3672#L9-4 assume true; 3598#L9-1 assume !(max_~i~0 < 5); 3599#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3609#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 3562#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3561#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 3560#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3558#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3559#L29-4 havoc main_#t~mem8; 3572#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3570#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3571#L9-10 assume true; 3682#L9-7 assume !!(max_~i~0 < 5); 3681#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3680#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3676#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3605#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3603#L9-10 assume true; 3604#L9-7 assume !!(max_~i~0 < 5); 3610#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3626#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3619#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3620#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3671#L9-10 assume true; 3670#L9-7 assume !!(max_~i~0 < 5); 3669#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3666#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3664#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3662#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3660#L9-10 assume true; 3658#L9-7 assume !!(max_~i~0 < 5); 3656#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3653#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3650#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3648#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3646#L9-10 assume true; 3644#L9-7 assume !!(max_~i~0 < 5); 3629#L10-6 [2018-11-10 07:31:56,799 INFO L795 eck$LassoCheckResult]: Loop: 3629#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3640#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3637#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3636#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3634#L9-10 assume true; 3628#L9-7 assume !!(max_~i~0 < 5); 3629#L10-6 [2018-11-10 07:31:56,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2052226106, now seen corresponding path program 4 times [2018-11-10 07:31:56,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 6 times [2018-11-10 07:31:56,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:56,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash -450069304, now seen corresponding path program 5 times [2018-11-10 07:31:56,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:56,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:31:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 48 proven. 22 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 07:31:56,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:31:56,990 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ce799-fda8-4075-884d-9f7af8d7a29c/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:31:56,999 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 07:31:57,051 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 07:31:57,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:31:57,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:31:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 07:31:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:31:57,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2018-11-10 07:31:57,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:31:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:31:57,161 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. cyclomatic complexity: 20 Second operand 15 states. [2018-11-10 07:31:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:31:57,399 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2018-11-10 07:31:57,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:31:57,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 194 transitions. [2018-11-10 07:31:57,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 07:31:57,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 133 states and 144 transitions. [2018-11-10 07:31:57,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-10 07:31:57,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2018-11-10 07:31:57,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 144 transitions. [2018-11-10 07:31:57,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:31:57,402 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-11-10 07:31:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 144 transitions. [2018-11-10 07:31:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-10 07:31:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 07:31:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-11-10 07:31:57,404 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-11-10 07:31:57,404 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-11-10 07:31:57,404 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:31:57,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 144 transitions. [2018-11-10 07:31:57,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 07:31:57,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:31:57,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:31:57,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:31:57,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:31:57,406 INFO L793 eck$LassoCheckResult]: Stem: 4267#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4240#L23-4 assume true; 4259#L23-1 assume !!(main_~i~1 < 5); 4355#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4354#L24-1 havoc main_#t~nondet5; 4353#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4260#L23-4 assume true; 4248#L23-1 assume !!(main_~i~1 < 5); 4249#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4269#L24-1 havoc main_#t~nondet5; 4262#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4263#L23-4 assume true; 4352#L23-1 assume !!(main_~i~1 < 5); 4351#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4350#L24-1 havoc main_#t~nondet5; 4349#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4348#L23-4 assume true; 4347#L23-1 assume !!(main_~i~1 < 5); 4346#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4345#L24-1 havoc main_#t~nondet5; 4344#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4343#L23-4 assume true; 4339#L23-1 assume !!(main_~i~1 < 5); 4342#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4341#L24-1 havoc main_#t~nondet5; 4340#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4338#L23-4 assume true; 4246#L23-1 assume !(main_~i~1 < 5); 4247#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4225#L9-4 assume true; 4226#L9-1 assume !!(max_~i~0 < 5); 4232#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4241#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4255#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4228#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4229#L9-4 assume true; 4336#L9-1 assume !!(max_~i~0 < 5); 4334#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4329#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4326#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4324#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4322#L9-4 assume true; 4320#L9-1 assume !!(max_~i~0 < 5); 4318#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4313#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4310#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4308#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4306#L9-4 assume true; 4304#L9-1 assume !!(max_~i~0 < 5); 4302#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4297#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4294#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4292#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4290#L9-4 assume true; 4288#L9-1 assume !!(max_~i~0 < 5); 4286#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4281#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4278#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4276#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4274#L9-4 assume true; 4272#L9-1 assume !(max_~i~0 < 5); 4254#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4250#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 4231#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 4230#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 4227#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 4223#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 4224#L29-4 havoc main_#t~mem8; 4253#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 4251#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4235#L9-10 assume true; 4236#L9-7 assume !!(max_~i~0 < 5); 4252#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4271#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4264#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4242#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4243#L9-10 assume true; 4337#L9-7 assume !!(max_~i~0 < 5); 4335#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4332#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4327#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4325#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4323#L9-10 assume true; 4321#L9-7 assume !!(max_~i~0 < 5); 4319#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4316#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4311#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4309#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4307#L9-10 assume true; 4305#L9-7 assume !!(max_~i~0 < 5); 4303#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4300#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4295#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4293#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4291#L9-10 assume true; 4289#L9-7 assume !!(max_~i~0 < 5); 4287#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4284#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4279#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4277#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4275#L9-10 assume true; 4273#L9-7 assume !(max_~i~0 < 5); 4261#L9-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4244#L12-1 main_#t~ret9 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9; 4245#L31 SUMMARY for call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 4233#L31-1 main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 4234#L32-4 [2018-11-10 07:31:57,406 INFO L795 eck$LassoCheckResult]: Loop: 4234#L32-4 assume true; 4237#L32-1 assume !!(main_~i~2 < 4); 4238#L33 SUMMARY for call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~2 + 1) * 4, 4); srcloc: L33 4266#L33-1 SUMMARY for call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + main_~i~2 * 4, 4); srcloc: L33-1 4265#L33-2 havoc main_#t~mem12; 4257#L32-3 main_#t~post11 := main_~i~2;main_~i~2 := main_#t~post11 + 1;havoc main_#t~post11; 4234#L32-4 [2018-11-10 07:31:57,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1301894441, now seen corresponding path program 1 times [2018-11-10 07:31:57,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:57,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:31:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:57,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:57,465 INFO L82 PathProgramCache]: Analyzing trace with hash -858483063, now seen corresponding path program 1 times [2018-11-10 07:31:57,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:57,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:57,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:31:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2035510705, now seen corresponding path program 1 times [2018-11-10 07:31:57,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:31:57,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:31:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:57,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:31:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:31:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:31:59,895 WARN L179 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 389 DAG size of output: 304 [2018-11-10 07:32:00,481 WARN L179 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 121 [2018-11-10 07:32:00,483 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:32:00,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:32:00,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:32:00,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:32:00,483 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:32:00,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:32:00,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:32:00,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:32:00,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-10 07:32:00,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:32:00,483 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:32:00,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,817 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2018-11-10 07:32:00,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:00,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:32:01,124 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:32:01,124 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:32:01,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:32:01,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:32:01,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:32:01,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:32:01,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:32:01,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,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 [2018-11-10 07:32:01,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,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 [2018-11-10 07:32:01,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,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 [2018-11-10 07:32:01,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:32:01,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:32:01,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:32:01,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:32:01,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:32:01,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,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 [2018-11-10 07:32:01,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:32:01,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:32:01,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:32:01,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,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 [2018-11-10 07:32:01,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:32:01,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:32:01,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:32:01,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:32:01,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:32:01,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:32:01,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:32:01,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:32:01,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:32:01,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:32:01,162 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:32:01,176 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:32:01,176 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:32:01,176 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:32:01,177 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 07:32:01,177 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:32:01,177 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_#Ultimate.alloc_~size, ULTIMATE.start_main_~i~2) = 7*ULTIMATE.start_#Ultimate.alloc_~size - 40*ULTIMATE.start_main_~i~2 Supporting invariants [1*ULTIMATE.start_#Ultimate.alloc_~size - 20 >= 0] [2018-11-10 07:32:01,292 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-10 07:32:01,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~size [2018-11-10 07:32:01,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:01,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:32:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:01,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:32:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:01,368 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 07:32:01,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 144 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-10 07:32:01,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 144 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 139 states and 151 transitions. Complement of second has 7 states. [2018-11-10 07:32:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:32:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:32:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-10 07:32:01,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 107 letters. Loop has 6 letters. [2018-11-10 07:32:01,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:32:01,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 113 letters. Loop has 6 letters. [2018-11-10 07:32:01,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:32:01,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 107 letters. Loop has 12 letters. [2018-11-10 07:32:01,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:32:01,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 151 transitions. [2018-11-10 07:32:01,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:32:01,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2018-11-10 07:32:01,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:32:01,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:32:01,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:32:01,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:32:01,393 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:32:01,393 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:32:01,394 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:32:01,394 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 07:32:01,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:32:01,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:32:01,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:32:01,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:32:01 BoogieIcfgContainer [2018-11-10 07:32:01,399 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:32:01,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:32:01,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:32:01,400 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:32:01,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:31:52" (3/4) ... [2018-11-10 07:32:01,403 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:32:01,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:32:01,404 INFO L168 Benchmark]: Toolchain (without parser) took 8977.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 960.3 MB in the beginning and 1.0 GB in the end (delta: -60.7 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:32:01,405 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:32:01,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.89 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:32:01,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.07 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:32:01,406 INFO L168 Benchmark]: Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:32:01,406 INFO L168 Benchmark]: RCFGBuilder took 315.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:32:01,407 INFO L168 Benchmark]: BuchiAutomizer took 8438.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.2 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:32:01,407 INFO L168 Benchmark]: Witness Printer took 3.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:32:01,409 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.89 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.07 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8438.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.2 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable ~size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 6 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function 7 * unknown-~size-unknown + -40 * i and consists of 5 locations. 11 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 15 iterations. TraceHistogramMax:6. Analysis of lassos took 7.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 184 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 143 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 732 SDtfs, 908 SDslu, 1732 SDs, 0 SdLazy, 628 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax100 hnf99 lsp95 ukn76 mio100 lsp49 div100 bol100 ite100 ukn100 eq170 hnf87 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...