./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max10-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/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 26bc4a4da598eefeae13591143340a28d87c3535 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 19:38:49,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:38:49,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:38:49,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:38:49,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:38:49,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:38:49,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:38:49,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:38:49,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:38:49,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:38:49,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:38:49,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:38:49,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:38:49,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:38:49,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:38:49,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:38:49,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:38:49,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:38:49,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:38:49,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:38:49,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:38:49,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:38:49,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:38:49,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:38:49,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:38:49,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:38:49,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:38:49,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:38:49,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:38:49,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:38:49,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:38:49,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:38:49,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:38:49,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:38:49,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:38:49,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:38:49,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:38:49,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:38:49,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:38:49,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:38:49,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:38:49,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 19:38:49,572 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:38:49,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:38:49,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:38:49,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:38:49,575 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:38:49,575 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 19:38:49,575 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 19:38:49,575 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 19:38:49,576 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 19:38:49,576 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 19:38:49,577 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 19:38:49,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:38:49,578 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:38:49,578 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:38:49,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:38:49,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:38:49,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:38:49,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 19:38:49,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 19:38:49,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 19:38:49,579 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:38:49,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:38:49,580 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 19:38:49,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:38:49,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 19:38:49,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:38:49,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:38:49,581 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 19:38:49,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:38:49,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:38:49,584 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:38:49,584 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 19:38:49,585 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 19:38:49,585 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/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 -> 26bc4a4da598eefeae13591143340a28d87c3535 [2020-11-29 19:38:49,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:38:49,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:38:49,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:38:49,876 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:38:49,877 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:38:49,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/max10-1.i [2020-11-29 19:38:49,953 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/data/4c89a160e/f0dd3e3cc74d408db2a21bd7a17e352e/FLAGaa5bd9a6d [2020-11-29 19:38:50,516 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:38:50,516 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/sv-benchmarks/c/reducercommutativity/max10-1.i [2020-11-29 19:38:50,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/data/4c89a160e/f0dd3e3cc74d408db2a21bd7a17e352e/FLAGaa5bd9a6d [2020-11-29 19:38:50,884 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/data/4c89a160e/f0dd3e3cc74d408db2a21bd7a17e352e [2020-11-29 19:38:50,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:38:50,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:38:50,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:38:50,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:38:50,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:38:50,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:38:50" (1/1) ... [2020-11-29 19:38:50,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d94b4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:50, skipping insertion in model container [2020-11-29 19:38:50,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:38:50" (1/1) ... [2020-11-29 19:38:50,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:38:50,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:38:51,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:38:51,202 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:38:51,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:38:51,265 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:38:51,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51 WrapperNode [2020-11-29 19:38:51,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:38:51,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:38:51,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:38:51,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:38:51,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:38:51,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:38:51,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:38:51,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:38:51,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... [2020-11-29 19:38:51,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:38:51,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:38:51,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:38:51,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:38:51,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/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 [2020-11-29 19:38:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:38:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:38:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:38:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:38:51,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:38:51,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 19:38:51,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:38:52,034 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:38:52,036 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-11-29 19:38:52,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:38:52 BoogieIcfgContainer [2020-11-29 19:38:52,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:38:52,041 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 19:38:52,041 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 19:38:52,044 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 19:38:52,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:38:52,046 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 07:38:50" (1/3) ... [2020-11-29 19:38:52,047 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f1e1e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:38:52, skipping insertion in model container [2020-11-29 19:38:52,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:38:52,047 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:51" (2/3) ... [2020-11-29 19:38:52,048 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f1e1e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:38:52, skipping insertion in model container [2020-11-29 19:38:52,048 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:38:52,048 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:38:52" (3/3) ... [2020-11-29 19:38:52,050 INFO L373 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2020-11-29 19:38:52,118 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 19:38:52,118 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 19:38:52,119 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 19:38:52,119 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:38:52,119 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:38:52,119 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 19:38:52,119 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:38:52,119 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 19:38:52,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-11-29 19:38:52,159 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-11-29 19:38:52,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:52,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:52,166 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:38:52,166 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:38:52,166 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 19:38:52,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-11-29 19:38:52,170 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-11-29 19:38:52,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:52,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:52,171 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:38:52,171 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:38:52,179 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9#L34-3true [2020-11-29 19:38:52,179 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 12#L34-2true main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 9#L34-3true [2020-11-29 19:38:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 19:38:52,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:52,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778995789] [2020-11-29 19:38:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:52,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:52,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:52,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-29 19:38:52,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:52,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184003366] [2020-11-29 19:38:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:52,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:52,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:52,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-29 19:38:52,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:52,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744354222] [2020-11-29 19:38:52,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:52,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:52,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:52,420 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:52,818 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-11-29 19:38:52,984 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 19:38:53,004 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:38:53,005 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:38:53,005 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:38:53,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:38:53,006 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:38:53,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:53,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:38:53,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:38:53,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2020-11-29 19:38:53,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:38:53,008 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:38:53,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,461 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-11-29 19:38:53,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:38:53,912 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:38:53,918 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:53,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:53,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:53,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:53,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:53,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:53,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:53,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:53,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:53,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:53,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:53,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:53,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:53,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:53,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:53,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:53,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:53,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:53,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:54,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:54,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,582 INFO L120 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 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:54,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:54,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:54,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:54,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:54,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:54,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:54,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:54,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:54,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:54,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:54,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:54,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:54,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:54,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:54,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:55,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:55,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:55,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:55,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:55,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:55,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:55,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:55,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:55,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:55,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:55,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:55,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:55,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:55,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:55,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:55,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:55,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:38:55,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:55,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:55,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:55,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:55,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:55,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:55,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:38:55,201 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-11-29 19:38:55,201 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:55,206 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:55,214 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:38:55,214 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:38:55,215 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-11-29 19:38:55,278 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-11-29 19:38:55,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 19:38:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:55,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:38:55,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:55,349 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 19:38:55,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:55,412 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 [2020-11-29 19:38:55,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2020-11-29 19:38:55,544 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 3 states. Result 87 states and 124 transitions. Complement of second has 8 states. [2020-11-29 19:38:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:38:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:38:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-11-29 19:38:55,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-29 19:38:55,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:38:55,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 19:38:55,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:38:55,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-29 19:38:55,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:38:55,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 124 transitions. [2020-11-29 19:38:55,556 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:55,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2020-11-29 19:38:55,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-11-29 19:38:55,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:55,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-11-29 19:38:55,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:55,571 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-11-29 19:38:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-11-29 19:38:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-11-29 19:38:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-29 19:38:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-11-29 19:38:55,600 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-11-29 19:38:55,601 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-11-29 19:38:55,601 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 19:38:55,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-11-29 19:38:55,602 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:55,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:55,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:55,603 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 19:38:55,603 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:55,603 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 204#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 205#L34-3 assume !(main_~i~1 < 10); 203#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 193#L20-3 [2020-11-29 19:38:55,604 INFO L796 eck$LassoCheckResult]: Loop: 193#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 194#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 202#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 198#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 193#L20-3 [2020-11-29 19:38:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-11-29 19:38:55,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:55,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257374597] [2020-11-29 19:38:55,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:55,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257374597] [2020-11-29 19:38:55,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:55,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:38:55,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656655049] [2020-11-29 19:38:55,706 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:55,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-11-29 19:38:55,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:55,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786452178] [2020-11-29 19:38:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:55,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:55,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:55,723 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:55,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:38:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:38:55,775 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-11-29 19:38:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:55,857 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-11-29 19:38:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:38:55,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-11-29 19:38:55,862 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:55,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-11-29 19:38:55,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:55,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:55,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-11-29 19:38:55,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:55,863 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-11-29 19:38:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-11-29 19:38:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-11-29 19:38:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-29 19:38:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-11-29 19:38:55,873 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-11-29 19:38:55,874 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-11-29 19:38:55,874 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 19:38:55,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-11-29 19:38:55,875 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:55,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:55,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:55,878 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-29 19:38:55,878 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:55,878 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 261#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 262#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 263#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 264#L34-3 assume !(main_~i~1 < 10); 260#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 250#L20-3 [2020-11-29 19:38:55,878 INFO L796 eck$LassoCheckResult]: Loop: 250#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 251#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 259#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 254#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 250#L20-3 [2020-11-29 19:38:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-11-29 19:38:55,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:55,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887306618] [2020-11-29 19:38:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:55,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887306618] [2020-11-29 19:38:55,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963516665] [2020-11-29 19:38:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:55,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:38:55,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:56,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:56,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 19:38:56,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626106619] [2020-11-29 19:38:56,011 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-11-29 19:38:56,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53114172] [2020-11-29 19:38:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,027 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:56,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:38:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:38:56,082 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-11-29 19:38:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:56,111 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-11-29 19:38:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:38:56,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-11-29 19:38:56,113 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-11-29 19:38:56,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:56,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:56,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-11-29 19:38:56,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:56,115 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-11-29 19:38:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-11-29 19:38:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-11-29 19:38:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-29 19:38:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-11-29 19:38:56,118 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-11-29 19:38:56,118 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-11-29 19:38:56,118 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 19:38:56,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-11-29 19:38:56,119 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:56,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:56,120 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:38:56,120 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:56,120 INFO L794 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 337#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 338#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 339#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 340#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 341#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 346#L34-3 assume !(main_~i~1 < 10); 336#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 326#L20-3 [2020-11-29 19:38:56,120 INFO L796 eck$LassoCheckResult]: Loop: 326#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 327#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 335#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 330#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 326#L20-3 [2020-11-29 19:38:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,121 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-11-29 19:38:56,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10054531] [2020-11-29 19:38:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:56,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10054531] [2020-11-29 19:38:56,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100539381] [2020-11-29 19:38:56,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:56,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:38:56,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:38:56,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:38:56,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:56,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:56,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 19:38:56,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994576302] [2020-11-29 19:38:56,234 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:56,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-11-29 19:38:56,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428571660] [2020-11-29 19:38:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,247 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:56,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:56,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:38:56,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:38:56,310 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-11-29 19:38:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:56,336 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-11-29 19:38:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:38:56,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-11-29 19:38:56,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-11-29 19:38:56,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:56,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:56,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-11-29 19:38:56,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:56,343 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-11-29 19:38:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-11-29 19:38:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-11-29 19:38:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-29 19:38:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-11-29 19:38:56,350 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-11-29 19:38:56,350 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-11-29 19:38:56,350 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 19:38:56,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-11-29 19:38:56,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:56,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:56,353 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-11-29 19:38:56,354 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:56,355 INFO L794 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 428#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 424#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 425#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 426#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 427#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 429#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 435#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 434#L34-3 assume !(main_~i~1 < 10); 423#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 413#L20-3 [2020-11-29 19:38:56,355 INFO L796 eck$LassoCheckResult]: Loop: 413#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 414#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 422#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 417#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 413#L20-3 [2020-11-29 19:38:56,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-11-29 19:38:56,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125193421] [2020-11-29 19:38:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:56,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125193421] [2020-11-29 19:38:56,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398663974] [2020-11-29 19:38:56,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:56,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 19:38:56,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:38:56,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 19:38:56,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:56,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:56,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 19:38:56,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754977603] [2020-11-29 19:38:56,571 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-11-29 19:38:56,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66681435] [2020-11-29 19:38:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,606 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:56,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:38:56,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:38:56,661 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-11-29 19:38:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:56,691 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-11-29 19:38:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:38:56,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-11-29 19:38:56,714 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-11-29 19:38:56,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:56,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:56,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-11-29 19:38:56,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:56,715 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-11-29 19:38:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-11-29 19:38:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-11-29 19:38:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 19:38:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-11-29 19:38:56,718 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-11-29 19:38:56,718 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-11-29 19:38:56,718 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 19:38:56,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-11-29 19:38:56,719 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:56,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:56,719 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-11-29 19:38:56,719 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:56,720 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 522#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 523#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 524#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 525#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 526#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 528#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 535#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 534#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 533#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 532#L34-3 assume !(main_~i~1 < 10); 521#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 511#L20-3 [2020-11-29 19:38:56,720 INFO L796 eck$LassoCheckResult]: Loop: 511#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 512#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 520#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 515#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 511#L20-3 [2020-11-29 19:38:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-11-29 19:38:56,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781252336] [2020-11-29 19:38:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:56,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781252336] [2020-11-29 19:38:56,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950319104] [2020-11-29 19:38:56,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:56,846 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 19:38:56,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:38:56,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 19:38:56,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:56,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:56,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 19:38:56,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785841283] [2020-11-29 19:38:56,884 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-11-29 19:38:56,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36035724] [2020-11-29 19:38:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,894 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:56,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:56,906 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:56,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:56,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:38:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:38:56,952 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-11-29 19:38:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:56,979 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-11-29 19:38:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:38:56,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2020-11-29 19:38:56,981 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2020-11-29 19:38:56,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:56,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:56,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2020-11-29 19:38:56,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:56,983 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-11-29 19:38:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2020-11-29 19:38:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-11-29 19:38:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-29 19:38:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-11-29 19:38:56,985 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-11-29 19:38:56,986 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-11-29 19:38:56,986 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 19:38:56,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-11-29 19:38:56,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:56,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:56,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:56,987 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-11-29 19:38:56,987 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:56,987 INFO L794 eck$LassoCheckResult]: Stem: 636#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 631#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 632#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 633#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 634#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 635#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 637#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 646#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 645#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 644#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 643#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 642#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 641#L34-3 assume !(main_~i~1 < 10); 630#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 620#L20-3 [2020-11-29 19:38:56,987 INFO L796 eck$LassoCheckResult]: Loop: 620#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 621#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 629#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 624#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 620#L20-3 [2020-11-29 19:38:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:56,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-11-29 19:38:56,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:56,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994068182] [2020-11-29 19:38:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:57,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994068182] [2020-11-29 19:38:57,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133459013] [2020-11-29 19:38:57,114 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:57,171 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-29 19:38:57,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:38:57,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 19:38:57,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:57,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:57,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-29 19:38:57,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047132298] [2020-11-29 19:38:57,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-11-29 19:38:57,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:57,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243493835] [2020-11-29 19:38:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:57,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:57,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:57,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:57,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:38:57,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:38:57,286 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 9 states. [2020-11-29 19:38:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:57,321 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-11-29 19:38:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:38:57,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2020-11-29 19:38:57,322 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:57,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2020-11-29 19:38:57,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:57,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:57,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2020-11-29 19:38:57,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:57,324 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-11-29 19:38:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2020-11-29 19:38:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-11-29 19:38:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-29 19:38:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-11-29 19:38:57,327 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-11-29 19:38:57,327 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-11-29 19:38:57,327 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 19:38:57,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-11-29 19:38:57,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:57,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:57,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:57,328 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-11-29 19:38:57,329 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:57,329 INFO L794 eck$LassoCheckResult]: Stem: 757#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 755#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 751#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 752#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 753#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 754#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 756#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 768#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 767#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 766#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 765#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 764#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 763#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 762#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 761#L34-3 assume !(main_~i~1 < 10); 750#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 740#L20-3 [2020-11-29 19:38:57,329 INFO L796 eck$LassoCheckResult]: Loop: 740#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 741#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 749#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 744#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 740#L20-3 [2020-11-29 19:38:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-11-29 19:38:57,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:57,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073153007] [2020-11-29 19:38:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:57,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073153007] [2020-11-29 19:38:57,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462396031] [2020-11-29 19:38:57,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:57,511 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-29 19:38:57,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:38:57,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 19:38:57,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:57,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:57,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 19:38:57,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43881923] [2020-11-29 19:38:57,546 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2020-11-29 19:38:57,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:57,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228825019] [2020-11-29 19:38:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:57,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:57,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:57,566 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:57,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:38:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:38:57,612 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-11-29 19:38:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:57,656 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-11-29 19:38:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:38:57,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2020-11-29 19:38:57,657 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:57,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2020-11-29 19:38:57,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:57,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:57,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2020-11-29 19:38:57,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:57,659 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2020-11-29 19:38:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2020-11-29 19:38:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-11-29 19:38:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-29 19:38:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-11-29 19:38:57,662 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-11-29 19:38:57,662 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-11-29 19:38:57,662 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 19:38:57,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2020-11-29 19:38:57,662 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:57,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:57,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:57,663 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-11-29 19:38:57,663 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:57,664 INFO L794 eck$LassoCheckResult]: Stem: 888#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 886#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 882#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 883#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 884#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 885#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 887#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 901#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 900#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 899#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 898#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 897#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 896#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 895#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 894#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 893#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 892#L34-3 assume !(main_~i~1 < 10); 881#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 871#L20-3 [2020-11-29 19:38:57,664 INFO L796 eck$LassoCheckResult]: Loop: 871#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 872#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 880#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 875#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 871#L20-3 [2020-11-29 19:38:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-11-29 19:38:57,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:57,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765893263] [2020-11-29 19:38:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:57,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765893263] [2020-11-29 19:38:57,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756169286] [2020-11-29 19:38:57,799 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:57,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:38:57,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:57,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:57,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-29 19:38:57,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740585295] [2020-11-29 19:38:57,894 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2020-11-29 19:38:57,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:57,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973088957] [2020-11-29 19:38:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:57,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:57,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:57,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:57,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:38:57,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:38:57,955 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-11-29 19:38:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:57,998 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-11-29 19:38:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:38:58,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2020-11-29 19:38:58,001 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:58,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2020-11-29 19:38:58,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:58,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:58,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2020-11-29 19:38:58,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:58,002 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2020-11-29 19:38:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2020-11-29 19:38:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-11-29 19:38:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-29 19:38:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-11-29 19:38:58,006 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-11-29 19:38:58,006 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-11-29 19:38:58,006 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 19:38:58,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-11-29 19:38:58,007 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:58,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:58,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:58,008 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-11-29 19:38:58,008 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:58,008 INFO L794 eck$LassoCheckResult]: Stem: 1029#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1024#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1025#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1026#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1027#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1028#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1030#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1045#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1044#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1043#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1042#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1041#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1040#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1039#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1038#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1037#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1036#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1035#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1034#L34-3 assume !(main_~i~1 < 10); 1023#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1013#L20-3 [2020-11-29 19:38:58,008 INFO L796 eck$LassoCheckResult]: Loop: 1013#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1014#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1022#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1017#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1013#L20-3 [2020-11-29 19:38:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-11-29 19:38:58,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:58,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979384717] [2020-11-29 19:38:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:58,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979384717] [2020-11-29 19:38:58,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820830179] [2020-11-29 19:38:58,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:58,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:38:58,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:38:58,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 19:38:58,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:58,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:58,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 19:38:58,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171720082] [2020-11-29 19:38:58,245 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:58,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2020-11-29 19:38:58,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:58,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269416057] [2020-11-29 19:38:58,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,263 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:58,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:38:58,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:38:58,304 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand 12 states. [2020-11-29 19:38:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:58,346 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-11-29 19:38:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:38:58,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2020-11-29 19:38:58,348 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:58,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2020-11-29 19:38:58,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:58,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:58,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2020-11-29 19:38:58,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:58,349 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-11-29 19:38:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2020-11-29 19:38:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-11-29 19:38:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-29 19:38:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-11-29 19:38:58,353 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-11-29 19:38:58,353 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-11-29 19:38:58,353 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 19:38:58,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2020-11-29 19:38:58,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:58,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:58,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:58,359 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-11-29 19:38:58,359 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:58,359 INFO L794 eck$LassoCheckResult]: Stem: 1182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1177#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1178#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1179#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1180#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1181#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1183#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1200#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1199#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1198#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1197#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1196#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1195#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1194#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1193#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1192#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1191#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1190#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1189#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1188#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1187#L34-3 assume !(main_~i~1 < 10); 1176#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1166#L20-3 [2020-11-29 19:38:58,359 INFO L796 eck$LassoCheckResult]: Loop: 1166#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1167#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1175#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1170#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1166#L20-3 [2020-11-29 19:38:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:58,360 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-11-29 19:38:58,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:58,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528572323] [2020-11-29 19:38:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:58,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528572323] [2020-11-29 19:38:58,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563320448] [2020-11-29 19:38:58,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:38:58,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-29 19:38:58,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:38:58,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 19:38:58,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:58,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:58,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-11-29 19:38:58,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123098511] [2020-11-29 19:38:58,646 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:58,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2020-11-29 19:38:58,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:58,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063174912] [2020-11-29 19:38:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,661 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:58,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:38:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:38:58,702 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-11-29 19:38:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:58,761 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2020-11-29 19:38:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:38:58,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2020-11-29 19:38:58,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:58,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2020-11-29 19:38:58,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 19:38:58,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 19:38:58,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2020-11-29 19:38:58,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:58,764 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-11-29 19:38:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2020-11-29 19:38:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-29 19:38:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-29 19:38:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-11-29 19:38:58,767 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-11-29 19:38:58,767 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-11-29 19:38:58,767 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 19:38:58,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2020-11-29 19:38:58,767 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 19:38:58,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:58,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:58,768 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-11-29 19:38:58,768 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:38:58,768 INFO L794 eck$LassoCheckResult]: Stem: 1345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1340#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1341#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1342#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1343#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1344#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1346#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1365#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1364#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1363#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1362#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1361#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1360#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1359#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1358#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1357#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1356#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1355#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1354#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1353#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1352#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1351#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1350#L34-3 assume !(main_~i~1 < 10); 1339#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1329#L20-3 [2020-11-29 19:38:58,769 INFO L796 eck$LassoCheckResult]: Loop: 1329#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1330#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1338#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1333#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1329#L20-3 [2020-11-29 19:38:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-11-29 19:38:58,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:58,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659428542] [2020-11-29 19:38:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,843 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,849 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2020-11-29 19:38:58,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:58,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548701698] [2020-11-29 19:38:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,858 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:58,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:58,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2020-11-29 19:38:58,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:58,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328713541] [2020-11-29 19:38:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:58,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:58,909 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:04,254 WARN L193 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 251 DAG size of output: 181 [2020-11-29 19:39:04,703 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:39:04,716 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:39:04,716 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:39:04,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:39:04,716 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:39:04,717 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:39:04,717 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:04,717 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:39:04,717 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:39:04,717 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration12_Lasso [2020-11-29 19:39:04,717 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:39:04,717 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:39:04,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:04,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,068 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-11-29 19:39:05,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:05,478 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:39:05,478 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:05,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:05,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:05,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:05,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:05,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:05,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:05,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:05,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:05,970 INFO L120 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 Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:05,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:05,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:05,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:05,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:05,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:05,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:05,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:05,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:05,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:05,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:06,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:06,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:06,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:06,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:06,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:06,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:06,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:06,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:06,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:06,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:06,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:06,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:06,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:06,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:06,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:06,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:06,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:06,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:06,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:06,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:06,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:06,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:06,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:06,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:06,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:06,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:06,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:06,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:06,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:06,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:06,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:06,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:06,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:06,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:06,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:06,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:06,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:06,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:06,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:06,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:06,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:06,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:06,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:06,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:06,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:06,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:06,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:06,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:06,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:06,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:06,267 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:39:06,294 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-11-29 19:39:06,294 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:06,315 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:39:06,317 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:39:06,317 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:39:06,317 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2020-11-29 19:39:06,370 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-11-29 19:39:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:06,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:39:06,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:06,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:39:06,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:06,425 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 [2020-11-29 19:39:06,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-11-29 19:39:06,447 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2020-11-29 19:39:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:39:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:39:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-11-29 19:39:06,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2020-11-29 19:39:06,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:39:06,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2020-11-29 19:39:06,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:39:06,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2020-11-29 19:39:06,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:39:06,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2020-11-29 19:39:06,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:06,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2020-11-29 19:39:06,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-29 19:39:06,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 19:39:06,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2020-11-29 19:39:06,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:06,459 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-11-29 19:39:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2020-11-29 19:39:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-29 19:39:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-29 19:39:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2020-11-29 19:39:06,461 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-11-29 19:39:06,461 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-11-29 19:39:06,461 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 19:39:06,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2020-11-29 19:39:06,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:06,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:06,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:06,462 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:06,462 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:06,462 INFO L794 eck$LassoCheckResult]: Stem: 1590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1585#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1586#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1587#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1588#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1589#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1591#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1610#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1609#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1608#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1607#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1606#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1605#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1604#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1603#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1602#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1601#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1600#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1599#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1598#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1597#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1596#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1595#L34-3 assume !(main_~i~1 < 10); 1584#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1573#L20-3 assume !(max_~i~0 < 10); 1569#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1570#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1594#L20-8 [2020-11-29 19:39:06,462 INFO L796 eck$LassoCheckResult]: Loop: 1594#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1579#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1571#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1572#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1594#L20-8 [2020-11-29 19:39:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2020-11-29 19:39:06,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:06,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244203145] [2020-11-29 19:39:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 19:39:06,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244203145] [2020-11-29 19:39:06,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:06,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:39:06,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078818246] [2020-11-29 19:39:06,525 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-11-29 19:39:06,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:06,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748857061] [2020-11-29 19:39:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:06,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:06,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:06,536 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:06,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:39:06,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:39:06,580 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-11-29 19:39:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:06,633 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-11-29 19:39:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:39:06,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2020-11-29 19:39:06,635 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:06,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2020-11-29 19:39:06,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-29 19:39:06,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-11-29 19:39:06,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2020-11-29 19:39:06,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:06,637 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-11-29 19:39:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2020-11-29 19:39:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-11-29 19:39:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-29 19:39:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-11-29 19:39:06,640 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-11-29 19:39:06,640 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-11-29 19:39:06,640 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-29 19:39:06,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2020-11-29 19:39:06,641 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:06,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:06,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:06,642 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:06,642 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:06,642 INFO L794 eck$LassoCheckResult]: Stem: 1695#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1690#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1691#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1692#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1693#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1694#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1716#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1715#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1714#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1713#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1712#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1711#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1710#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1709#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1708#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1707#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1706#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1705#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1704#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1703#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1702#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1701#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1700#L34-3 assume !(main_~i~1 < 10); 1689#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1678#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1679#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1688#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1683#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1680#L20-3 assume !(max_~i~0 < 10); 1674#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1675#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1698#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1684#L21-3 [2020-11-29 19:39:06,642 INFO L796 eck$LassoCheckResult]: Loop: 1684#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1676#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1677#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1699#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1684#L21-3 [2020-11-29 19:39:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2020-11-29 19:39:06,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:06,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245232244] [2020-11-29 19:39:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 19:39:06,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245232244] [2020-11-29 19:39:06,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151197247] [2020-11-29 19:39:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:06,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:39:06,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 19:39:06,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:06,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 19:39:06,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877258313] [2020-11-29 19:39:06,779 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-11-29 19:39:06,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:06,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319963197] [2020-11-29 19:39:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:06,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:06,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:06,795 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:06,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:06,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:39:06,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:39:06,879 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-11-29 19:39:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:06,949 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2020-11-29 19:39:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:39:06,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2020-11-29 19:39:06,950 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:06,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2020-11-29 19:39:06,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-11-29 19:39:06,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-11-29 19:39:06,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2020-11-29 19:39:06,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:06,952 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2020-11-29 19:39:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2020-11-29 19:39:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2020-11-29 19:39:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-29 19:39:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2020-11-29 19:39:06,955 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-11-29 19:39:06,956 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-11-29 19:39:06,956 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-29 19:39:06,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2020-11-29 19:39:06,956 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:06,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:06,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:06,963 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:06,966 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:06,967 INFO L794 eck$LassoCheckResult]: Stem: 1910#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1905#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1906#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1907#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1908#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1909#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1937#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1936#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1935#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1934#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1933#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1932#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1931#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1930#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1929#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1928#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1927#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1926#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1925#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1923#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1921#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1920#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1919#L34-3 assume !(main_~i~1 < 10); 1904#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1891#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1892#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1918#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1917#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1893#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1894#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1903#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1897#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1898#L20-3 assume !(max_~i~0 < 10); 1887#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1888#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 1914#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1924#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1922#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1915#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1913#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1899#L21-3 [2020-11-29 19:39:06,967 INFO L796 eck$LassoCheckResult]: Loop: 1899#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1889#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 1890#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1916#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1899#L21-3 [2020-11-29 19:39:06,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2020-11-29 19:39:06,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:06,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783290833] [2020-11-29 19:39:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-11-29 19:39:07,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783290833] [2020-11-29 19:39:07,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299425633] [2020-11-29 19:39:07,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:07,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:39:07,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-11-29 19:39:07,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:07,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 19:39:07,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981271832] [2020-11-29 19:39:07,172 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-11-29 19:39:07,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:07,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120554346] [2020-11-29 19:39:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:07,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:07,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:07,182 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:07,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:07,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:39:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:39:07,265 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-11-29 19:39:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:07,338 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2020-11-29 19:39:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:39:07,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2020-11-29 19:39:07,339 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:07,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2020-11-29 19:39:07,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-11-29 19:39:07,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-11-29 19:39:07,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2020-11-29 19:39:07,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:07,341 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2020-11-29 19:39:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2020-11-29 19:39:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2020-11-29 19:39:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-29 19:39:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-11-29 19:39:07,345 INFO L714 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-11-29 19:39:07,345 INFO L594 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-11-29 19:39:07,345 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-11-29 19:39:07,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2020-11-29 19:39:07,346 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:07,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:07,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:07,347 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:07,347 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:07,352 INFO L794 eck$LassoCheckResult]: Stem: 2169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2164#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2165#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2166#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2167#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2168#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2170#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2197#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2196#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2195#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2194#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2193#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2192#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2191#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2190#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2189#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2188#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2187#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2186#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2185#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2184#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2182#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2181#L34-3 assume !(main_~i~1 < 10); 2163#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 2149#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2150#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2203#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2202#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2151#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2152#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2162#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2155#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2156#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2177#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2198#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2183#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2176#L20-3 assume !(max_~i~0 < 10); 2145#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2146#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 2173#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2157#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2158#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2174#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2175#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2201#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2147#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2148#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2200#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2179#L21-3 [2020-11-29 19:39:07,352 INFO L796 eck$LassoCheckResult]: Loop: 2179#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2199#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2180#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2178#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2179#L21-3 [2020-11-29 19:39:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:07,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2020-11-29 19:39:07,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:07,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114330297] [2020-11-29 19:39:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-29 19:39:07,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114330297] [2020-11-29 19:39:07,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112828930] [2020-11-29 19:39:07,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:07,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:39:07,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:39:07,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 19:39:07,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-29 19:39:07,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:07,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 19:39:07,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193371532] [2020-11-29 19:39:07,524 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-11-29 19:39:07,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:07,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462287348] [2020-11-29 19:39:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:07,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:07,533 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:07,535 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:07,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:07,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:39:07,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:39:07,622 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-11-29 19:39:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:07,714 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-11-29 19:39:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:39:07,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2020-11-29 19:39:07,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:07,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2020-11-29 19:39:07,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-11-29 19:39:07,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-11-29 19:39:07,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2020-11-29 19:39:07,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:07,718 INFO L691 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2020-11-29 19:39:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2020-11-29 19:39:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2020-11-29 19:39:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-29 19:39:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2020-11-29 19:39:07,722 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-11-29 19:39:07,722 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-11-29 19:39:07,722 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-11-29 19:39:07,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2020-11-29 19:39:07,723 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:07,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:07,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:07,725 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:07,725 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:07,725 INFO L794 eck$LassoCheckResult]: Stem: 2473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2467#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2468#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2469#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2470#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2471#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2474#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2500#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2499#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2498#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2497#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2496#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2495#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2494#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2493#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2492#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2491#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2490#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2489#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2488#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2487#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2485#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2484#L34-3 assume !(main_~i~1 < 10); 2466#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 2452#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2453#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2472#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2514#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2454#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2455#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2465#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2458#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2459#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2513#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2512#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2511#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2509#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2480#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2502#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2486#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2479#L20-3 assume !(max_~i~0 < 10); 2448#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2449#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 2478#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2510#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2450#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2451#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2477#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2460#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2461#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2508#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2507#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2506#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2505#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2504#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2503#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2482#L21-3 [2020-11-29 19:39:07,725 INFO L796 eck$LassoCheckResult]: Loop: 2482#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2501#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2483#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2481#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2482#L21-3 [2020-11-29 19:39:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:07,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2020-11-29 19:39:07,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:07,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459935792] [2020-11-29 19:39:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-11-29 19:39:07,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459935792] [2020-11-29 19:39:07,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759294682] [2020-11-29 19:39:07,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:07,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-29 19:39:07,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:39:07,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 19:39:07,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-11-29 19:39:07,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:07,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 19:39:07,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19649200] [2020-11-29 19:39:07,957 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:07,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:07,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-11-29 19:39:07,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:07,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953782988] [2020-11-29 19:39:07,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:07,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:07,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:07,972 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:08,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:39:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:39:08,053 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-11-29 19:39:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:08,171 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2020-11-29 19:39:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:39:08,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2020-11-29 19:39:08,173 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:08,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2020-11-29 19:39:08,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2020-11-29 19:39:08,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-11-29 19:39:08,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2020-11-29 19:39:08,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:08,174 INFO L691 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2020-11-29 19:39:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2020-11-29 19:39:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2020-11-29 19:39:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-29 19:39:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2020-11-29 19:39:08,179 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-11-29 19:39:08,179 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-11-29 19:39:08,179 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-11-29 19:39:08,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2020-11-29 19:39:08,179 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:08,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:08,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:08,181 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:08,181 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:08,181 INFO L794 eck$LassoCheckResult]: Stem: 2821#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2815#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2816#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2817#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2818#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2819#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2822#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2849#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2848#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2847#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2846#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2845#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2844#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2843#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2842#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2841#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2840#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2839#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2838#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2837#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2836#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2834#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2833#L34-3 assume !(main_~i~1 < 10); 2814#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 2800#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2801#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2820#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2806#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2802#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2803#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2870#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2869#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2868#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2867#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2866#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2865#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2864#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2863#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2812#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2813#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2862#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2829#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2851#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2835#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2828#L20-3 assume !(max_~i~0 < 10); 2796#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2797#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 2825#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2807#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2808#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2826#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2827#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2861#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2798#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2799#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2860#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2859#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2858#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2857#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2856#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2855#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2854#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2853#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2852#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2831#L21-3 [2020-11-29 19:39:08,181 INFO L796 eck$LassoCheckResult]: Loop: 2831#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2850#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 2832#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2830#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2831#L21-3 [2020-11-29 19:39:08,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:08,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2020-11-29 19:39:08,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:08,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272788881] [2020-11-29 19:39:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-11-29 19:39:08,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272788881] [2020-11-29 19:39:08,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413117344] [2020-11-29 19:39:08,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:08,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 19:39:08,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:39:08,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 19:39:08,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-11-29 19:39:08,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:08,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-29 19:39:08,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020419922] [2020-11-29 19:39:08,400 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2020-11-29 19:39:08,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:08,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273292309] [2020-11-29 19:39:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:08,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:08,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:08,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:08,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:39:08,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:39:08,493 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand 9 states. [2020-11-29 19:39:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:08,638 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2020-11-29 19:39:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:39:08,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2020-11-29 19:39:08,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:08,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2020-11-29 19:39:08,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-11-29 19:39:08,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-11-29 19:39:08,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2020-11-29 19:39:08,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:08,642 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2020-11-29 19:39:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2020-11-29 19:39:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2020-11-29 19:39:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-29 19:39:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2020-11-29 19:39:08,658 INFO L714 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-11-29 19:39:08,658 INFO L594 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-11-29 19:39:08,658 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-11-29 19:39:08,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2020-11-29 19:39:08,659 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:08,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:08,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:08,661 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:08,662 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:08,665 INFO L794 eck$LassoCheckResult]: Stem: 3214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3208#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3209#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3210#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3211#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3212#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3215#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3242#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3241#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3240#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3239#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3238#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3237#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3236#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3235#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3234#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3233#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3232#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3231#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3230#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3229#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3227#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3226#L34-3 assume !(main_~i~1 < 10); 3207#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 3193#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3194#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3213#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3199#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3195#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3196#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3271#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3270#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3269#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3268#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3267#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3266#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3265#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3264#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3263#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3262#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3261#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3260#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3205#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3206#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3259#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3222#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3244#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3228#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3221#L20-3 assume !(max_~i~0 < 10); 3189#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3190#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 3218#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3200#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3201#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3219#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3220#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3258#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3191#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3192#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3257#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3256#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3255#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3254#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3253#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3252#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3251#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3250#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3249#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3248#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3247#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3246#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3245#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3224#L21-3 [2020-11-29 19:39:08,666 INFO L796 eck$LassoCheckResult]: Loop: 3224#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 3243#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3225#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3223#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3224#L21-3 [2020-11-29 19:39:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2020-11-29 19:39:08,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:08,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71241302] [2020-11-29 19:39:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-29 19:39:08,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71241302] [2020-11-29 19:39:08,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555913705] [2020-11-29 19:39:08,773 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:08,906 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-11-29 19:39:08,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:39:08,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 19:39:08,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-29 19:39:08,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:08,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 19:39:08,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262937755] [2020-11-29 19:39:08,940 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2020-11-29 19:39:08,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:08,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492488127] [2020-11-29 19:39:08,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:08,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:08,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:08,954 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:09,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:39:09,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:39:09,025 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand 10 states. [2020-11-29 19:39:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:09,232 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2020-11-29 19:39:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:39:09,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2020-11-29 19:39:09,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:09,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2020-11-29 19:39:09,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-11-29 19:39:09,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-11-29 19:39:09,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2020-11-29 19:39:09,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:09,237 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-11-29 19:39:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2020-11-29 19:39:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2020-11-29 19:39:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-29 19:39:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2020-11-29 19:39:09,241 INFO L714 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-11-29 19:39:09,241 INFO L594 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-11-29 19:39:09,241 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-11-29 19:39:09,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2020-11-29 19:39:09,242 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:09,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:09,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:09,252 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:09,252 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:09,253 INFO L794 eck$LassoCheckResult]: Stem: 3651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3646#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3647#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3648#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3649#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3650#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3652#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3679#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3678#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3677#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3676#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3675#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3674#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3673#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3672#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3671#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3670#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3669#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3668#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3667#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3666#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3664#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3663#L34-3 assume !(main_~i~1 < 10); 3645#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 3631#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3632#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3643#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3644#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3633#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3634#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3717#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3638#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3639#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3716#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3715#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3714#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3713#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3712#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3711#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3710#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3709#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3708#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3707#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3706#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3705#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3704#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3703#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3702#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3699#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3659#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3681#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3665#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3658#L20-3 assume !(max_~i~0 < 10); 3629#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3630#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 3656#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3701#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3700#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3657#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3655#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3637#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3627#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3628#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3698#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3697#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3696#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3695#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3694#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3693#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3692#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3691#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3690#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3689#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3688#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3687#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3686#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3685#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3684#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3683#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3682#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3661#L21-3 [2020-11-29 19:39:09,253 INFO L796 eck$LassoCheckResult]: Loop: 3661#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 3680#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 3662#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3660#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3661#L21-3 [2020-11-29 19:39:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2020-11-29 19:39:09,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:09,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847389042] [2020-11-29 19:39:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-11-29 19:39:09,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847389042] [2020-11-29 19:39:09,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430528035] [2020-11-29 19:39:09,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:09,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-11-29 19:39:09,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:39:09,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:39:09,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-11-29 19:39:09,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:09,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-29 19:39:09,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396036195] [2020-11-29 19:39:09,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:09,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2020-11-29 19:39:09,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:09,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480450918] [2020-11-29 19:39:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:09,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:09,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:09,839 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:09,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:09,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:39:09,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:39:09,911 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand 11 states. [2020-11-29 19:39:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:10,135 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2020-11-29 19:39:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:39:10,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2020-11-29 19:39:10,137 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:10,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2020-11-29 19:39:10,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-11-29 19:39:10,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-11-29 19:39:10,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2020-11-29 19:39:10,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:10,139 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2020-11-29 19:39:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2020-11-29 19:39:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2020-11-29 19:39:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-29 19:39:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2020-11-29 19:39:10,142 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-11-29 19:39:10,142 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-11-29 19:39:10,142 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-11-29 19:39:10,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2020-11-29 19:39:10,143 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:10,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:10,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:10,144 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:10,144 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:10,144 INFO L794 eck$LassoCheckResult]: Stem: 4135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 4129#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4130#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4131#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4132#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4133#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4136#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4162#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4161#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4160#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4159#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4158#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4157#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4156#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4155#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4154#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4153#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4152#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4151#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4150#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4149#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4147#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4146#L34-3 assume !(main_~i~1 < 10); 4128#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 4114#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4115#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4134#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4208#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4116#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4117#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4127#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4120#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4121#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4207#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4206#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4205#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4204#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4203#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4202#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4201#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4200#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4199#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4198#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4197#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4196#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4195#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4194#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4193#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4192#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4191#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4190#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4189#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4187#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4142#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4164#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4148#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4141#L20-3 assume !(max_~i~0 < 10); 4110#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4111#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 4140#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4188#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4112#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4113#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4139#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4122#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4123#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4186#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4185#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4184#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4183#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4182#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4181#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4180#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4179#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4178#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4177#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4176#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4175#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4174#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4173#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4172#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4171#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4170#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4169#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4168#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4167#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4166#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4165#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4144#L21-3 [2020-11-29 19:39:10,144 INFO L796 eck$LassoCheckResult]: Loop: 4144#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 4163#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4145#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4143#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4144#L21-3 [2020-11-29 19:39:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:10,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2020-11-29 19:39:10,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:10,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536035698] [2020-11-29 19:39:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2020-11-29 19:39:10,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536035698] [2020-11-29 19:39:10,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569187819] [2020-11-29 19:39:10,305 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:10,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 19:39:10,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2020-11-29 19:39:10,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:10,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 19:39:10,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087656206] [2020-11-29 19:39:10,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2020-11-29 19:39:10,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:10,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825616268] [2020-11-29 19:39:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:10,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:10,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:10,439 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:10,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:10,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:39:10,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:39:10,506 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand 12 states. [2020-11-29 19:39:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:10,688 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2020-11-29 19:39:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:39:10,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2020-11-29 19:39:10,690 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:10,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2020-11-29 19:39:10,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-11-29 19:39:10,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-11-29 19:39:10,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2020-11-29 19:39:10,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:10,692 INFO L691 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2020-11-29 19:39:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2020-11-29 19:39:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2020-11-29 19:39:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-29 19:39:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2020-11-29 19:39:10,695 INFO L714 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-11-29 19:39:10,695 INFO L594 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-11-29 19:39:10,695 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-11-29 19:39:10,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2020-11-29 19:39:10,696 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:10,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:10,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:10,697 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:10,698 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:10,698 INFO L794 eck$LassoCheckResult]: Stem: 4662#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 4657#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4658#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4659#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4660#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4661#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4663#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4689#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4688#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4687#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4686#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4685#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4684#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4683#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4682#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4681#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4680#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4679#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4678#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4677#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4676#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4674#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4673#L34-3 assume !(main_~i~1 < 10); 4656#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 4642#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4643#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4744#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4648#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4644#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4645#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4654#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4655#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4743#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4742#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4741#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4740#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4739#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4738#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4737#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4736#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4735#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4734#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4733#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4732#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4731#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4730#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4729#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4728#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4727#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4726#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4725#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4724#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4723#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4722#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4721#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4720#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4719#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4669#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4691#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4675#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4668#L20-3 assume !(max_~i~0 < 10); 4638#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4639#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 4667#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4718#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4640#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4641#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4666#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4649#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4650#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4717#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4716#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4715#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4714#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4713#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4712#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4711#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4710#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4709#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4708#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4707#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4706#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4705#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4704#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4703#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4702#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4701#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4700#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4699#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4698#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4697#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4696#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4695#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4694#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4693#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4692#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4671#L21-3 [2020-11-29 19:39:10,698 INFO L796 eck$LassoCheckResult]: Loop: 4671#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 4690#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 4672#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4670#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4671#L21-3 [2020-11-29 19:39:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2020-11-29 19:39:10,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:10,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574932762] [2020-11-29 19:39:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-11-29 19:39:10,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574932762] [2020-11-29 19:39:10,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466853305] [2020-11-29 19:39:10,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:10,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:39:10,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:39:10,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 19:39:10,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-11-29 19:39:11,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:39:11,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-11-29 19:39:11,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677541202] [2020-11-29 19:39:11,010 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:39:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2020-11-29 19:39:11,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:11,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36188573] [2020-11-29 19:39:11,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:11,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:11,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:11,020 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:11,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:39:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:39:11,096 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand 13 states. [2020-11-29 19:39:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:11,274 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2020-11-29 19:39:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:39:11,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2020-11-29 19:39:11,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:11,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2020-11-29 19:39:11,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2020-11-29 19:39:11,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2020-11-29 19:39:11,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2020-11-29 19:39:11,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:11,278 INFO L691 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2020-11-29 19:39:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2020-11-29 19:39:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2020-11-29 19:39:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-29 19:39:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2020-11-29 19:39:11,282 INFO L714 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-11-29 19:39:11,282 INFO L594 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-11-29 19:39:11,282 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-11-29 19:39:11,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2020-11-29 19:39:11,283 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:39:11,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:11,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:11,284 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:11,284 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:39:11,284 INFO L794 eck$LassoCheckResult]: Stem: 5226#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 5221#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5222#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5223#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5224#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5225#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5268#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5266#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5264#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5262#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5260#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5258#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5256#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5254#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5252#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5250#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5248#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5246#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5244#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5242#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5240#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5238#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5237#L34-3 assume !(main_~i~1 < 10); 5220#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 5206#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5207#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5218#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5219#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5208#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5209#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5316#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5315#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5314#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5313#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5312#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5311#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5310#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5309#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5308#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5307#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5306#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5305#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5304#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5213#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5214#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5303#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5302#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5301#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5300#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5299#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5298#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5296#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5294#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5292#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5290#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5288#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5286#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5284#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5282#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5280#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5278#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5232#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5275#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5273#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5231#L20-3 assume !(max_~i~0 < 10); 5204#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5205#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 5229#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5212#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5202#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5203#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5230#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5297#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5295#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5293#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5291#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5289#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5287#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5285#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5283#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5281#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5279#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5277#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5276#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5274#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5272#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5271#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5270#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5269#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5267#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5265#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5263#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5261#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5259#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5257#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5255#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5253#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5251#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5249#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5247#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5245#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5243#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5241#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5239#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5234#L21-3 [2020-11-29 19:39:11,284 INFO L796 eck$LassoCheckResult]: Loop: 5234#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 5236#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5235#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5233#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5234#L21-3 [2020-11-29 19:39:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2020-11-29 19:39:11,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:11,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515087460] [2020-11-29 19:39:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:11,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:11,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:11,545 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2020-11-29 19:39:11,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:11,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633928815] [2020-11-29 19:39:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:11,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:11,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:11,553 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2020-11-29 19:39:11,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:11,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510868932] [2020-11-29 19:39:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 37 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2020-11-29 19:39:11,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510868932] [2020-11-29 19:39:11,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184030841] [2020-11-29 19:39:11,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:39:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:11,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-29 19:39:11,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2020-11-29 19:39:11,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:39:11,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2020-11-29 19:39:11,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099253324] [2020-11-29 19:39:11,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:11,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:39:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:39:11,988 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand 13 states. [2020-11-29 19:39:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:12,252 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2020-11-29 19:39:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:39:12,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2020-11-29 19:39:12,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 19:39:12,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2020-11-29 19:39:12,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-11-29 19:39:12,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-11-29 19:39:12,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2020-11-29 19:39:12,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:12,257 INFO L691 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-11-29 19:39:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2020-11-29 19:39:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-29 19:39:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-29 19:39:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2020-11-29 19:39:12,260 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-11-29 19:39:12,260 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-11-29 19:39:12,260 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-11-29 19:39:12,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2020-11-29 19:39:12,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 19:39:12,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:39:12,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:39:12,266 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:12,266 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:39:12,267 INFO L794 eck$LassoCheckResult]: Stem: 5829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 5824#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5825#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5826#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5827#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5828#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5879#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5876#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5873#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5870#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5867#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5864#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5861#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5858#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5855#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5852#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5849#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5846#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5843#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5840#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5838#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5836#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5835#L34-3 assume !(main_~i~1 < 10); 5823#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 5815#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5816#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5822#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5817#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5818#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5922#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5921#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5920#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5918#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5916#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5914#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5912#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5910#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5908#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5906#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5904#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5902#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5900#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5898#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5896#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5894#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5892#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5890#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5888#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5886#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5883#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5881#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5878#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5875#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5872#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5869#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5866#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5863#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5860#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5857#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5854#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5851#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5848#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5845#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5842#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5834#L20-3 assume !(max_~i~0 < 10); 5811#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5812#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, 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; 5832#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5819#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5813#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5814#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5833#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5919#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5917#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5915#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5913#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5911#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5909#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5907#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5905#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5903#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5901#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5899#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5897#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5895#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5893#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5891#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5889#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5887#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5885#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5884#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5882#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5880#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5877#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5874#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5871#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5868#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5865#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5862#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5859#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5856#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5853#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5850#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5847#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5844#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5841#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4;havoc max_#t~ite6; 5839#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5837#L20-8 assume !(max_~i~0 < 10); 5830#L20-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5831#L23-1 main_#t~ret12 := max_#res;main_~ret2~0 := main_#t~ret12;havoc main_#t~ret12;call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem13;havoc main_#t~mem13;main_~i~2 := 0; 5820#L43-3 [2020-11-29 19:39:12,267 INFO L796 eck$LassoCheckResult]: Loop: 5820#L43-3 assume !!(main_~i~2 < 9);call main_#t~mem15 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem15, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem15; 5821#L43-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 5820#L43-3 [2020-11-29 19:39:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:12,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2020-11-29 19:39:12,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:12,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011307176] [2020-11-29 19:39:12,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:12,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:12,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:12,480 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2020-11-29 19:39:12,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:12,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682196458] [2020-11-29 19:39:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:12,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:12,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:12,488 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2020-11-29 19:39:12,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:12,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100295409] [2020-11-29 19:39:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:12,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:12,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:12,632 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:38,997 WARN L193 SmtUtils]: Spent 26.30 s on a formula simplification. DAG size of input: 717 DAG size of output: 502 [2020-11-29 19:39:44,517 WARN L193 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 245 DAG size of output: 183 [2020-11-29 19:39:44,524 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:39:44,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:39:44,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:39:44,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:39:44,524 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:39:44,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:44,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:39:44,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:39:44,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration24_Lasso [2020-11-29 19:39:44,524 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:39:44,525 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:39:44,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:44,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:46,755 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2020-11-29 19:39:46,960 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-11-29 19:39:46,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:46,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:46,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:46,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:39:48,075 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:39:48,075 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:48,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:48,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:48,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:48,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:48,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:48,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:48,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:48,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:48,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:48,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:48,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:48,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:48,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:48,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:48,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:48,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:48,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:48,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:48,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:48,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:48,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:48,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:48,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:48,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:49,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:49,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:49,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:49,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:49,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:49,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:49,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:49,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:49,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:49,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:49,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:49,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:49,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:49,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:49,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:49,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:49,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:49,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:49,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:49,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:49,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:49,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:49,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:49,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:49,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:49,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:49,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:49,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:49,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:49,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:49,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:39:49,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:49,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:49,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:49,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:49,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:49,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:49,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:49,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:49,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:49,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:49,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:39:49,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:49,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:49,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:49,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:39:49,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:39:49,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:49,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:39:49,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:39:49,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:39:49,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:39:49,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:39:49,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:39:49,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:39:49,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:39:49,315 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-11-29 19:39:49,315 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5b51c1b-8e10-462c-989c-5deec1e7b2e6/bin/uautomizer/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:39:49,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:39:49,319 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:39:49,319 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:39:49,320 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 17*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2020-11-29 19:39:49,812 INFO L297 tatePredicateManager]: 86 out of 86 supporting invariants were superfluous and have been removed [2020-11-29 19:39:49,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 19:39:49,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:49,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:39:49,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:49,954 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 19:39:49,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:39:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:49,991 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 [2020-11-29 19:39:49,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-11-29 19:39:50,015 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23. Second operand 3 states. Result 114 states and 136 transitions. Complement of second has 4 states. [2020-11-29 19:39:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 19:39:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:39:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-11-29 19:39:50,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2020-11-29 19:39:50,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:39:50,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2020-11-29 19:39:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:39:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2020-11-29 19:39:50,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:39:50,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2020-11-29 19:39:50,022 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:39:50,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2020-11-29 19:39:50,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 19:39:50,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 19:39:50,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 19:39:50,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:39:50,023 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:39:50,023 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:39:50,023 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:39:50,023 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-11-29 19:39:50,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 19:39:50,023 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:39:50,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 19:39:50,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 07:39:50 BoogieIcfgContainer [2020-11-29 19:39:50,030 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 19:39:50,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:39:50,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:39:50,031 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:39:50,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:38:52" (3/4) ... [2020-11-29 19:39:50,035 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 19:39:50,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:39:50,037 INFO L168 Benchmark]: Toolchain (without parser) took 59145.23 ms. Allocated memory was 94.4 MB in the beginning and 299.9 MB in the end (delta: 205.5 MB). Free memory was 65.0 MB in the beginning and 149.4 MB in the end (delta: -84.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:50,037 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 94.4 MB. Free memory is still 53.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:39:50,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.21 ms. Allocated memory was 94.4 MB in the beginning and 117.4 MB in the end (delta: 23.1 MB). Free memory was 64.7 MB in the beginning and 95.1 MB in the end (delta: -30.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:50,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.73 ms. Allocated memory is still 117.4 MB. Free memory was 95.1 MB in the beginning and 93.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:50,040 INFO L168 Benchmark]: Boogie Preprocessor took 61.34 ms. Allocated memory is still 117.4 MB. Free memory was 93.0 MB in the beginning and 91.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:50,040 INFO L168 Benchmark]: RCFGBuilder took 630.95 ms. Allocated memory is still 117.4 MB. Free memory was 91.4 MB in the beginning and 72.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:50,041 INFO L168 Benchmark]: BuchiAutomizer took 57989.49 ms. Allocated memory was 117.4 MB in the beginning and 299.9 MB in the end (delta: 182.5 MB). Free memory was 72.0 MB in the beginning and 149.4 MB in the end (delta: -77.4 MB). Peak memory consumption was 107.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:50,041 INFO L168 Benchmark]: Witness Printer took 5.25 ms. Allocated memory is still 299.9 MB. Free memory is still 149.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:39:50,044 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.81 ms. Allocated memory is still 94.4 MB. Free memory is still 53.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 372.21 ms. Allocated memory was 94.4 MB in the beginning and 117.4 MB in the end (delta: 23.1 MB). Free memory was 64.7 MB in the beginning and 95.1 MB in the end (delta: -30.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.73 ms. Allocated memory is still 117.4 MB. Free memory was 95.1 MB in the beginning and 93.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.34 ms. Allocated memory is still 117.4 MB. Free memory was 93.0 MB in the beginning and 91.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 630.95 ms. Allocated memory is still 117.4 MB. Free memory was 91.4 MB in the beginning and 72.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 57989.49 ms. Allocated memory was 117.4 MB in the beginning and 299.9 MB in the end (delta: 182.5 MB). Free memory was 72.0 MB in the beginning and 149.4 MB in the end (delta: -77.4 MB). Peak memory consumption was 107.6 MB. Max. memory is 16.1 GB. * Witness Printer took 5.25 ms. Allocated memory is still 299.9 MB. Free memory is still 149.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function 17 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 57.9s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 54.9s. Construction of modules took 1.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 280 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 117 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 638 SDtfs, 1144 SDslu, 1940 SDs, 0 SdLazy, 1117 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital408 mio100 ax100 hnf99 lsp96 ukn43 mio100 lsp43 div100 bol100 ite100 ukn100 eq175 hnf88 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms 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...