./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.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_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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 78f95c70d702e3726c098ef8eec3c10bcd690c4e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:17,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:38:17,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:38:17,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:38:17,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:38:17,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:38:17,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:38:17,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:38:17,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:38:17,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:38:17,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:38:17,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:38:17,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:38:17,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:38:17,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:38:17,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:38:17,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:38:17,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:38:17,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:38:17,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:38:17,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:38:17,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:38:17,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:38:17,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:38:17,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:38:17,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:38:17,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:38:17,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:38:17,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:38:17,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:38:17,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:38:17,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:38:17,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:38:17,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:38:17,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:38:17,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:38:17,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:38:17,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:38:17,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:38:17,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:38:17,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:38:17,346 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 19:38:17,372 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:38:17,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:38:17,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:38:17,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:38:17,374 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:38:17,375 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 19:38:17,375 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 19:38:17,375 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 19:38:17,375 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 19:38:17,376 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 19:38:17,376 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 19:38:17,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:38:17,376 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:38:17,377 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:38:17,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:38:17,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:38:17,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:38:17,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 19:38:17,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 19:38:17,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 19:38:17,378 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:38:17,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:38:17,379 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 19:38:17,379 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:38:17,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 19:38:17,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:38:17,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:38:17,380 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 19:38:17,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:38:17,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:38:17,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:38:17,381 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 19:38:17,382 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 19:38:17,383 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_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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 -> 78f95c70d702e3726c098ef8eec3c10bcd690c4e [2020-11-29 19:38:17,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:38:17,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:38:17,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:38:17,682 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:38:17,683 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:38:17,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2020-11-29 19:38:17,776 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/data/36c67c188/5f6f6dcf80f9419c9ddd5a792d08cf7c/FLAGfc65d4419 [2020-11-29 19:38:18,354 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:38:18,355 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2020-11-29 19:38:18,366 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/data/36c67c188/5f6f6dcf80f9419c9ddd5a792d08cf7c/FLAGfc65d4419 [2020-11-29 19:38:18,718 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/data/36c67c188/5f6f6dcf80f9419c9ddd5a792d08cf7c [2020-11-29 19:38:18,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:38:18,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:38:18,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:38:18,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:38:18,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:38:18,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:38:18" (1/1) ... [2020-11-29 19:38:18,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dafdbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:18, skipping insertion in model container [2020-11-29 19:38:18,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:38:18" (1/1) ... [2020-11-29 19:38:18,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:38:18,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:38:18,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:38:18,959 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:38:18,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:38:18,996 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:38:18,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:18 WrapperNode [2020-11-29 19:38:18,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:38:18,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:38:18,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:38:18,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:38:19,006 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:18" (1/1) ... [2020-11-29 19:38:19,014 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:18" (1/1) ... [2020-11-29 19:38:19,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:38:19,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:38:19,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:38:19,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:38:19,047 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:18" (1/1) ... [2020-11-29 19:38:19,048 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:18" (1/1) ... [2020-11-29 19:38:19,051 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:18" (1/1) ... [2020-11-29 19:38:19,052 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:18" (1/1) ... [2020-11-29 19:38:19,060 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:18" (1/1) ... [2020-11-29 19:38:19,065 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:18" (1/1) ... [2020-11-29 19:38:19,067 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:18" (1/1) ... [2020-11-29 19:38:19,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:38:19,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:38:19,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:38:19,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:38:19,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 19:38:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-29 19:38:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:38:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 19:38:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:38:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:38:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:38:19,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:38:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 19:38:19,798 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:38:19,798 INFO L298 CfgBuilder]: Removed 31 assume(true) statements. [2020-11-29 19:38:19,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:38:19 BoogieIcfgContainer [2020-11-29 19:38:19,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:38:19,801 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 19:38:19,801 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 19:38:19,806 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 19:38:19,806 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:38:19,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 07:38:18" (1/3) ... [2020-11-29 19:38:19,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216f4afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:38:19, skipping insertion in model container [2020-11-29 19:38:19,808 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:38:19,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:38:18" (2/3) ... [2020-11-29 19:38:19,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216f4afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:38:19, skipping insertion in model container [2020-11-29 19:38:19,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:38:19,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:38:19" (3/3) ... [2020-11-29 19:38:19,812 INFO L373 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2020-11-29 19:38:19,869 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 19:38:19,870 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 19:38:19,870 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 19:38:19,870 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:38:19,870 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:38:19,870 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 19:38:19,870 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:38:19,871 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 19:38:19,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-11-29 19:38:19,906 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2020-11-29 19:38:19,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:19,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:19,919 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:38:19,920 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:38:19,920 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 19:38:19,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-11-29 19:38:19,923 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2020-11-29 19:38:19,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:19,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:19,924 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:38:19,924 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:38:19,931 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 5#L-1true havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 23#L19-3true [2020-11-29 19:38:19,931 INFO L796 eck$LassoCheckResult]: Loop: 23#L19-3true assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 29#L19-2true init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 23#L19-3true [2020-11-29 19:38:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 19:38:19,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:19,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737009848] [2020-11-29 19:38:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:20,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:20,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:20,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-29 19:38:20,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:20,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516831977] [2020-11-29 19:38:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:20,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:20,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:20,122 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-29 19:38:20,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:20,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676230538] [2020-11-29 19:38:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:20,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:20,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:20,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:20,315 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-29 19:38:20,372 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:38:20,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:38:20,469 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:38:20,470 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:185, output treesize:186 [2020-11-29 19:38:21,118 WARN L193 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2020-11-29 19:38:21,348 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-29 19:38:21,361 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:38:21,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:38:21,362 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:38:21,362 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:38:21,362 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:38:21,362 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:21,363 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:38:21,363 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:38:21,363 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2020-11-29 19:38:21,363 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:38:21,364 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:38:21,395 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:21,402 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:21,407 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:21,411 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:21,414 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:21,417 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:21,420 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:21,424 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:21,427 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:21,430 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:21,433 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:21,438 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:21,441 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:21,445 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:21,459 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:21,464 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:22,263 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-11-29 19:38:22,987 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:38:22,991 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,015 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:23,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,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:38:23,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,086 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:23,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,121 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:23,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,170 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:23,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,202 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:23,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,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_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,238 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:23,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,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_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,269 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:23,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,296 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:23,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,322 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:23,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,357 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:23,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,387 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:23,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,418 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:23,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,450 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:23,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,482 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:23,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,521 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:23,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) [2020-11-29 19:38:23,548 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,591 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:23,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,658 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:23,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,691 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:23,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,724 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:23,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,759 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:23,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,788 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:23,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) [2020-11-29 19:38:23,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 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,864 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:23,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,897 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:23,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:23,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:23,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:23,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:23,929 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:23,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:23,967 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:23,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:23,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:23,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:23,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:23,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:23,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:23,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:24,015 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:24,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:24,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:38:24,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:24,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:24,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:24,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:38:24,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:38:24,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:24,044 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:24,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:24,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:24,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:24,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:24,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:24,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:24,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:24,108 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:24,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:24,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:24,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:24,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:24,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:24,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:24,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:24,140 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:24,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:24,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:24,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:24,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:24,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:24,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:38:24,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:24,202 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:24,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:38:24,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:38:24,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:38:24,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:38:24,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:38:24,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:24,226 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:38:24,455 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-11-29 19:38:24,455 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:38:24,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:38:24,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:38:24,470 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:38:24,471 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0) = 3*v_rep(select #length ~#pp~0.base)_1 - 8*ULTIMATE.start_init_~i~0 Supporting invariants [] [2020-11-29 19:38:24,632 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-11-29 19:38:24,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 19:38:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:24,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:38:24,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:24,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 19:38:24,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:24,771 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:24,789 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:24,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states. Second operand 3 states. [2020-11-29 19:38:24,971 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states.. Second operand 3 states. Result 95 states and 138 transitions. Complement of second has 7 states. [2020-11-29 19:38:24,971 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:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:38:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2020-11-29 19:38:24,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-29 19:38:24,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:38:24,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 19:38:24,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:38:24,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-29 19:38:24,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:38:24,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 138 transitions. [2020-11-29 19:38:24,982 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-11-29 19:38:24,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 28 states and 37 transitions. [2020-11-29 19:38:24,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-11-29 19:38:24,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-29 19:38:24,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2020-11-29 19:38:24,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:24,993 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-11-29 19:38:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2020-11-29 19:38:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-11-29 19:38:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-29 19:38:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2020-11-29 19:38:25,021 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-11-29 19:38:25,021 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-11-29 19:38:25,021 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 19:38:25,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2020-11-29 19:38:25,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-11-29 19:38:25,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:25,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:25,027 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:25,027 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:38:25,027 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 264#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 265#L19-3 assume !(init_~i~0 < 2); 282#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 263#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 261#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 262#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 273#L27-3 [2020-11-29 19:38:25,027 INFO L796 eck$LassoCheckResult]: Loop: 273#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 274#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 278#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 273#L27-3 [2020-11-29 19:38:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2020-11-29 19:38:25,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363844081] [2020-11-29 19:38:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,094 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:25,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363844081] [2020-11-29 19:38:25,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:25,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:38:25,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854875515] [2020-11-29 19:38:25,097 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2020-11-29 19:38:25,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993126349] [2020-11-29 19:38:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,118 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:25,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:25,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:38:25,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:38:25,164 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-11-29 19:38:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:25,186 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2020-11-29 19:38:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:38:25,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2020-11-29 19:38:25,189 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-11-29 19:38:25,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2020-11-29 19:38:25,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-11-29 19:38:25,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-29 19:38:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2020-11-29 19:38:25,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:25,190 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-11-29 19:38:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2020-11-29 19:38:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-11-29 19:38:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-29 19:38:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-11-29 19:38:25,193 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-11-29 19:38:25,193 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-11-29 19:38:25,193 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 19:38:25,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-11-29 19:38:25,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-11-29 19:38:25,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:25,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:25,195 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:25,195 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:38:25,195 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 327#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 328#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 345#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 346#L19-3 assume !(init_~i~0 < 2); 347#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 326#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 324#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 325#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 334#L27-3 [2020-11-29 19:38:25,195 INFO L796 eck$LassoCheckResult]: Loop: 334#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 335#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 341#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 334#L27-3 [2020-11-29 19:38:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2020-11-29 19:38:25,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465428120] [2020-11-29 19:38:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,231 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:25,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465428120] [2020-11-29 19:38:25,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127103474] [2020-11-29 19:38:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:38:25,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:25,395 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:25,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:25,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 19:38:25,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105360918] [2020-11-29 19:38:25,396 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:38:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2020-11-29 19:38:25,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119907913] [2020-11-29 19:38:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,416 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:25,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:38:25,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:38:25,480 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-11-29 19:38:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:25,515 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-11-29 19:38:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:38:25,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2020-11-29 19:38:25,518 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-11-29 19:38:25,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2020-11-29 19:38:25,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-11-29 19:38:25,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-29 19:38:25,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2020-11-29 19:38:25,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:25,520 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-11-29 19:38:25,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2020-11-29 19:38:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-29 19:38:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-29 19:38:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-11-29 19:38:25,523 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-11-29 19:38:25,523 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-11-29 19:38:25,523 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 19:38:25,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-11-29 19:38:25,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-11-29 19:38:25,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:25,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:25,525 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:25,525 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:38:25,525 INFO L794 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 417#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 418#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 435#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 436#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 437#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 443#L19-3 assume !(init_~i~0 < 2); 440#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 416#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 414#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 415#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 424#L27-3 [2020-11-29 19:38:25,525 INFO L796 eck$LassoCheckResult]: Loop: 424#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 425#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 431#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 424#L27-3 [2020-11-29 19:38:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2020-11-29 19:38:25,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962838049] [2020-11-29 19:38:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,642 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,660 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,661 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2020-11-29 19:38:25,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952933330] [2020-11-29 19:38:25,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:25,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:25,678 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2020-11-29 19:38:25,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776921322] [2020-11-29 19:38:25,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,104 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2020-11-29 19:38:26,366 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:26,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776921322] [2020-11-29 19:38:26,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386795640] [2020-11-29 19:38:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-29 19:38:26,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:38:26,474 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2020-11-29 19:38:26,476 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-29 19:38:26,508 INFO L625 ElimStorePlain]: treesize reduction 25, result has 40.5 percent of original size [2020-11-29 19:38:26,513 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:38:26,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2020-11-29 19:38:26,559 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2020-11-29 19:38:26,559 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:38:26,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:38:26,584 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2020-11-29 19:38:26,584 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:38:26,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:38:26,596 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:38:26,596 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:30 [2020-11-29 19:38:26,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:38:26,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2020-11-29 19:38:26,689 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:38:26,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:38:26,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:38:26,736 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2020-11-29 19:38:26,737 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:38:26,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:38:26,757 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:38:26,757 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:40 [2020-11-29 19:38:28,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:38:28,870 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-11-29 19:38:28,875 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:38:28,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:38:28,892 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:38:28,892 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-11-29 19:38:28,893 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:38:28,935 INFO L625 ElimStorePlain]: treesize reduction 12, result has 45.5 percent of original size [2020-11-29 19:38:28,939 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:38:28,939 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:7 [2020-11-29 19:38:28,942 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:28,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:38:28,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-11-29 19:38:28,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3285651] [2020-11-29 19:38:29,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:29,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 19:38:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=226, Unknown=3, NotChecked=0, Total=272 [2020-11-29 19:38:29,019 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand 17 states. [2020-11-29 19:38:30,538 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2020-11-29 19:38:31,423 WARN L193 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2020-11-29 19:38:33,219 WARN L193 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 61 DAG size of output: 28 [2020-11-29 19:38:34,217 WARN L193 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2020-11-29 19:38:36,630 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-11-29 19:38:38,911 WARN L193 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2020-11-29 19:38:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:39,054 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-11-29 19:38:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:38:39,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2020-11-29 19:38:39,055 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-29 19:38:39,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2020-11-29 19:38:39,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-11-29 19:38:39,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-11-29 19:38:39,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2020-11-29 19:38:39,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:38:39,057 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-11-29 19:38:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2020-11-29 19:38:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-11-29 19:38:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-29 19:38:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2020-11-29 19:38:39,060 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-11-29 19:38:39,060 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-11-29 19:38:39,060 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 19:38:39,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-11-29 19:38:39,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-29 19:38:39,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:38:39,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:38:39,063 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:39,063 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:38:39,063 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 551#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 552#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 566#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 567#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 568#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 574#L19-3 assume !(init_~i~0 < 2); 571#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 548#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 546#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 547#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 556#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 557#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 562#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 554#L27-7 [2020-11-29 19:38:39,063 INFO L796 eck$LassoCheckResult]: Loop: 554#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 569#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 553#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 554#L27-7 [2020-11-29 19:38:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2020-11-29 19:38:39,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:39,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479466186] [2020-11-29 19:38:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:39,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:39,132 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:39,147 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2020-11-29 19:38:39,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:39,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707687776] [2020-11-29 19:38:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:39,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:39,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:39,182 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:38:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2020-11-29 19:38:39,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:39,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090010102] [2020-11-29 19:38:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:39,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:38:39,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:38:39,359 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:27,387 WARN L193 SmtUtils]: Spent 47.97 s on a formula simplification. DAG size of input: 318 DAG size of output: 257 [2020-11-29 19:39:27,427 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_58|], 4=[|v_#memory_int_62|, |v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_53|, |v_#memory_$Pointer$.base_54|, |v_#memory_$Pointer$.offset_54|, |v_#memory_int_60|]} [2020-11-29 19:39:27,527 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:39:42,882 WARN L193 SmtUtils]: Spent 15.35 s on a formula simplification that was a NOOP. DAG size: 216 [2020-11-29 19:39:42,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:39:42,929 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:39:57,226 WARN L193 SmtUtils]: Spent 14.30 s on a formula simplification that was a NOOP. DAG size: 213 [2020-11-29 19:39:57,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:39:57,289 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:40:11,073 WARN L193 SmtUtils]: Spent 13.78 s on a formula simplification that was a NOOP. DAG size: 210 [2020-11-29 19:40:11,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:40:11,145 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:40:23,407 WARN L193 SmtUtils]: Spent 12.26 s on a formula simplification that was a NOOP. DAG size: 207 [2020-11-29 19:40:23,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:40:23,454 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:40:35,851 WARN L193 SmtUtils]: Spent 12.40 s on a formula simplification that was a NOOP. DAG size: 204 [2020-11-29 19:40:35,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:40:35,870 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:40:48,148 WARN L193 SmtUtils]: Spent 12.28 s on a formula simplification that was a NOOP. DAG size: 201 [2020-11-29 19:40:48,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:40:48,177 INFO L545 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:41:00,569 WARN L193 SmtUtils]: Spent 12.39 s on a formula simplification that was a NOOP. DAG size: 198 [2020-11-29 19:41:00,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:00,571 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2020-11-29 19:41:00,571 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:656, output treesize:2691 [2020-11-29 19:41:15,248 WARN L193 SmtUtils]: Spent 14.68 s on a formula simplification that was a NOOP. DAG size: 198 [2020-11-29 19:41:15,251 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:41:15,251 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:41:15,251 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:41:15,251 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:41:15,251 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:41:15,251 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:15,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:41:15,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:41:15,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2020-11-29 19:41:15,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:41:15,252 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:41:15,256 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:41:15,276 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:41:15,280 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:41:15,283 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:41:15,292 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:41:15,296 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:41:15,307 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:41:15,313 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:41:15,316 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:41:15,320 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:41:15,331 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:41:15,334 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:41:21,865 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 110 [2020-11-29 19:41:22,008 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2020-11-29 19:41:22,008 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:41:22,013 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:41:22,016 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:41:22,019 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:41:22,022 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:41:22,025 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:41:22,813 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:41:22,813 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:22,820 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:41:22,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:22,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:41:22,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:22,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:22,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:22,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:41:22,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:41:22,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:22,845 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:41:22,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:22,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:22,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:22,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:22,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:22,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:22,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:22,872 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:41:22,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:22,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:41:22,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:22,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:22,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:22,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:41:22,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:41:22,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:22,896 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:41:22,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:22,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:22,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:22,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:22,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:22,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:22,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:22,926 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:41:22,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:22,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:22,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:22,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:22,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:22,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:22,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,004 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:41:23,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,040 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:41:23,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,074 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:41:23,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:41:23,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:41:23,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:41:23,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,100 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:41:23,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:41:23,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:41:23,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:41:23,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,180 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:41:23,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:41:23,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:41:23,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:41:23,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,204 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:41:23,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,232 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:41:23,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) [2020-11-29 19:41:23,283 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:41:23,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,318 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:41:23,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,374 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:41:23,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,403 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:41:23,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,431 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:41:23,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,464 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:41:23,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) [2020-11-29 19:41:23,492 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:41:23,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:41:23,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:41:23,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_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,523 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:41:23,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,569 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:41:23,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,598 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:41:23,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,625 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:41:23,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,627 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-11-29 19:41:23,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,666 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2020-11-29 19:41:23,666 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-11-29 19:41:23,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,750 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:41:23,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:23,778 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:41:23,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:41:23,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:41:23,841 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:41:23,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:41:23,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:41:23,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:41:23,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:41:23,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:41:23,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:41:23,881 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-11-29 19:41:23,881 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/bin/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:41:23,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:41:23,888 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:41:23,888 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:41:23,888 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2020-11-29 19:41:24,171 INFO L297 tatePredicateManager]: 57 out of 57 supporting invariants were superfluous and have been removed [2020-11-29 19:41:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:24,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:41:24,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:41:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:24,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:41:24,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:41:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:41:24,244 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:41:24,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-11-29 19:41:24,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 68 states and 88 transitions. Complement of second has 6 states. [2020-11-29 19:41:24,285 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:41:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:41:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2020-11-29 19:41:24,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2020-11-29 19:41:24,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:41:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2020-11-29 19:41:24,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:41:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2020-11-29 19:41:24,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:41:24,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2020-11-29 19:41:24,294 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2020-11-29 19:41:24,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2020-11-29 19:41:24,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-11-29 19:41:24,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-11-29 19:41:24,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2020-11-29 19:41:24,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:41:24,295 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2020-11-29 19:41:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2020-11-29 19:41:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-11-29 19:41:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 19:41:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-11-29 19:41:24,298 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-11-29 19:41:24,298 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-11-29 19:41:24,298 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 19:41:24,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2020-11-29 19:41:24,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-29 19:41:24,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:41:24,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:41:24,300 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:41:24,300 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:41:24,301 INFO L794 eck$LassoCheckResult]: Stem: 974#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 950#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 951#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 966#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 967#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 968#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 975#L19-3 assume !(init_~i~0 < 2); 972#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 947#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 945#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 946#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 957#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 958#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 961#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 962#L27-7 assume !(f_~i~1 < 2); 955#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 956#L38-3 [2020-11-29 19:41:24,301 INFO L796 eck$LassoCheckResult]: Loop: 956#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 960#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 963#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 956#L38-3 [2020-11-29 19:41:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2020-11-29 19:41:24,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:24,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625551413] [2020-11-29 19:41:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:41:24,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625551413] [2020-11-29 19:41:24,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:41:24,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:41:24,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974986645] [2020-11-29 19:41:24,337 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:41:24,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:24,337 INFO L82 PathProgramCache]: Analyzing trace with hash 100840, now seen corresponding path program 1 times [2020-11-29 19:41:24,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:24,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337639222] [2020-11-29 19:41:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:24,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:24,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:24,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:24,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:41:24,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:41:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:41:24,406 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-11-29 19:41:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:41:24,439 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-11-29 19:41:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:41:24,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2020-11-29 19:41:24,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2020-11-29 19:41:24,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2020-11-29 19:41:24,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-11-29 19:41:24,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-11-29 19:41:24,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2020-11-29 19:41:24,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:41:24,444 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-11-29 19:41:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2020-11-29 19:41:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-11-29 19:41:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 19:41:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-11-29 19:41:24,447 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-11-29 19:41:24,447 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-11-29 19:41:24,447 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 19:41:24,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-11-29 19:41:24,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-29 19:41:24,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:41:24,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:41:24,448 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:41:24,448 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:41:24,449 INFO L794 eck$LassoCheckResult]: Stem: 1057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1031#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1032#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1049#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1050#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1051#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1058#L19-3 assume !(init_~i~0 < 2); 1055#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1030#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1028#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1029#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1038#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1039#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1044#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1045#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1052#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1040#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1041#L38-3 [2020-11-29 19:41:24,449 INFO L796 eck$LassoCheckResult]: Loop: 1041#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1043#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1046#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1041#L38-3 [2020-11-29 19:41:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2020-11-29 19:41:24,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:24,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225945162] [2020-11-29 19:41:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:41:24,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225945162] [2020-11-29 19:41:24,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:41:24,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:41:24,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868286259] [2020-11-29 19:41:24,685 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:41:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash 100840, now seen corresponding path program 2 times [2020-11-29 19:41:24,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:24,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974393711] [2020-11-29 19:41:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:24,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:24,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:24,691 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:24,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:41:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:41:24,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:41:24,744 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-11-29 19:41:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:41:25,046 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-11-29 19:41:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:41:25,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2020-11-29 19:41:25,047 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-11-29 19:41:25,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2020-11-29 19:41:25,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-11-29 19:41:25,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-11-29 19:41:25,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2020-11-29 19:41:25,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:41:25,049 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2020-11-29 19:41:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2020-11-29 19:41:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2020-11-29 19:41:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 19:41:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-11-29 19:41:25,052 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-11-29 19:41:25,052 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-11-29 19:41:25,052 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 19:41:25,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-11-29 19:41:25,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-29 19:41:25,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:41:25,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:41:25,053 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:41:25,053 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:41:25,054 INFO L794 eck$LassoCheckResult]: Stem: 1158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1134#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1135#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1150#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1151#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1152#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1159#L19-3 assume !(init_~i~0 < 2); 1156#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1131#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1129#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1130#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1141#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1142#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1145#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1146#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1154#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1136#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1137#L27-7 assume !(f_~i~1 < 2); 1139#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1140#L38-3 [2020-11-29 19:41:25,054 INFO L796 eck$LassoCheckResult]: Loop: 1140#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1144#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1147#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1140#L38-3 [2020-11-29 19:41:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2020-11-29 19:41:25,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:25,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375758191] [2020-11-29 19:41:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:41:25,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375758191] [2020-11-29 19:41:25,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415606434] [2020-11-29 19:41:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:25,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:41:25,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:41:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:41:25,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:41:25,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 19:41:25,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593778561] [2020-11-29 19:41:25,209 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:41:25,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:25,209 INFO L82 PathProgramCache]: Analyzing trace with hash 100840, now seen corresponding path program 3 times [2020-11-29 19:41:25,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:25,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792124438] [2020-11-29 19:41:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:25,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:25,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:25,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:25,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:41:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:41:25,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:41:25,275 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-11-29 19:41:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:41:25,308 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-11-29 19:41:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:41:25,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2020-11-29 19:41:25,313 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2020-11-29 19:41:25,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2020-11-29 19:41:25,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-11-29 19:41:25,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-11-29 19:41:25,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2020-11-29 19:41:25,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:41:25,314 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-11-29 19:41:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2020-11-29 19:41:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2020-11-29 19:41:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-29 19:41:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2020-11-29 19:41:25,316 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-11-29 19:41:25,316 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-11-29 19:41:25,317 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 19:41:25,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2020-11-29 19:41:25,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-29 19:41:25,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:41:25,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:41:25,322 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:41:25,323 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:41:25,324 INFO L794 eck$LassoCheckResult]: Stem: 1298#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1271#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1272#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1289#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1290#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1291#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1299#L19-3 assume !(init_~i~0 < 2); 1295#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1270#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1268#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1269#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1278#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1279#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1284#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1285#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1293#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1275#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1276#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1292#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1280#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1281#L38-3 [2020-11-29 19:41:25,324 INFO L796 eck$LassoCheckResult]: Loop: 1281#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1283#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1286#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1281#L38-3 [2020-11-29 19:41:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2020-11-29 19:41:25,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:25,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323470839] [2020-11-29 19:41:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:25,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:25,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:25,418 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:25,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash 100840, now seen corresponding path program 4 times [2020-11-29 19:41:25,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:25,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819315472] [2020-11-29 19:41:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:25,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:25,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:25,427 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash 951949730, now seen corresponding path program 1 times [2020-11-29 19:41:25,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:25,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779591758] [2020-11-29 19:41:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 19:41:25,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779591758] [2020-11-29 19:41:25,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139010941] [2020-11-29 19:41:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:26,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-29 19:41:26,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:41:26,042 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2020-11-29 19:41:26,044 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,080 INFO L625 ElimStorePlain]: treesize reduction 48, result has 26.2 percent of original size [2020-11-29 19:41:26,083 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,084 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2020-11-29 19:41:26,180 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2020-11-29 19:41:26,180 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:26,193 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2020-11-29 19:41:26,193 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:26,205 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,206 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:22 [2020-11-29 19:41:26,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:41:26,357 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2020-11-29 19:41:26,358 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:41:26,392 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2020-11-29 19:41:26,393 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:26,420 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,420 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:119, output treesize:18 [2020-11-29 19:41:26,510 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-29 19:41:26,510 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:26,523 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-29 19:41:26,523 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:26,532 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:26,532 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:10 [2020-11-29 19:41:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:41:26,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:41:26,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2020-11-29 19:41:26,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805184856] [2020-11-29 19:41:26,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:41:26,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 19:41:26,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2020-11-29 19:41:26,626 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand 23 states. [2020-11-29 19:41:27,671 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2020-11-29 19:41:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:41:27,791 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2020-11-29 19:41:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:41:27,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2020-11-29 19:41:27,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-29 19:41:27,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2020-11-29 19:41:27,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-29 19:41:27,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-29 19:41:27,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2020-11-29 19:41:27,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:41:27,794 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-11-29 19:41:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2020-11-29 19:41:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-11-29 19:41:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-29 19:41:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-11-29 19:41:27,797 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-11-29 19:41:27,797 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-11-29 19:41:27,797 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 19:41:27,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2020-11-29 19:41:27,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-29 19:41:27,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:41:27,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:41:27,798 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:41:27,798 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-29 19:41:27,798 INFO L794 eck$LassoCheckResult]: Stem: 1488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1462#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1463#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1479#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1480#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1481#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1491#L19-3 assume !(init_~i~0 < 2); 1485#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1459#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1457#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1458#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1467#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1468#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1472#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1473#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1483#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1464#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1465#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1482#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1469#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1470#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1471#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1486#L41 [2020-11-29 19:41:27,798 INFO L796 eck$LassoCheckResult]: Loop: 1486#L41 assume 1 == g_#t~mem12; 1484#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1474#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1475#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1492#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1486#L41 [2020-11-29 19:41:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2020-11-29 19:41:27,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:27,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365686554] [2020-11-29 19:41:27,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:27,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:27,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:27,903 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 102391059, now seen corresponding path program 1 times [2020-11-29 19:41:27,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:27,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174173587] [2020-11-29 19:41:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:27,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:27,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:27,914 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash -289316598, now seen corresponding path program 1 times [2020-11-29 19:41:27,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:27,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917787724] [2020-11-29 19:41:27,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:41:28,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917787724] [2020-11-29 19:41:28,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081681522] [2020-11-29 19:41:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:28,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-29 19:41:28,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:41:28,458 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2020-11-29 19:41:28,459 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-29 19:41:28,482 INFO L625 ElimStorePlain]: treesize reduction 25, result has 40.5 percent of original size [2020-11-29 19:41:28,488 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:28,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2020-11-29 19:41:28,738 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2020-11-29 19:41:28,738 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:28,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:28,745 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:28,745 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:16 [2020-11-29 19:41:28,843 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2020-11-29 19:41:28,844 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:28,853 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:28,854 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:28,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:15 [2020-11-29 19:41:28,936 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2020-11-29 19:41:28,937 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:28,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:28,944 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:28,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-29 19:41:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:41:28,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:41:28,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2020-11-29 19:41:28,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835057447] [2020-11-29 19:41:29,176 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2020-11-29 19:41:29,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:41:29,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-29 19:41:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2020-11-29 19:41:29,246 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand 26 states. [2020-11-29 19:41:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:41:30,699 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-11-29 19:41:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 19:41:30,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 63 transitions. [2020-11-29 19:41:30,700 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-11-29 19:41:30,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 63 transitions. [2020-11-29 19:41:30,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-11-29 19:41:30,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-11-29 19:41:30,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 63 transitions. [2020-11-29 19:41:30,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:41:30,702 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2020-11-29 19:41:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 63 transitions. [2020-11-29 19:41:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2020-11-29 19:41:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-29 19:41:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2020-11-29 19:41:30,705 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2020-11-29 19:41:30,705 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2020-11-29 19:41:30,705 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 19:41:30,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2020-11-29 19:41:30,705 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-29 19:41:30,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:41:30,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:41:30,706 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:41:30,706 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-29 19:41:30,706 INFO L794 eck$LassoCheckResult]: Stem: 1716#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1687#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1688#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1704#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1705#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1706#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1717#L19-3 assume !(init_~i~0 < 2); 1711#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1684#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1682#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1683#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1692#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1693#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1697#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1698#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1708#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1689#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1690#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1715#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1720#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1718#L27-7 assume !(f_~i~1 < 2); 1719#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1727#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1721#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1722#L41 [2020-11-29 19:41:30,707 INFO L796 eck$LassoCheckResult]: Loop: 1722#L41 assume 1 == g_#t~mem12; 1709#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1710#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1724#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1725#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1722#L41 [2020-11-29 19:41:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2020-11-29 19:41:30,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:30,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42520580] [2020-11-29 19:41:30,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:41:31,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42520580] [2020-11-29 19:41:31,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533903704] [2020-11-29 19:41:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:31,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 26 conjunts are in the unsatisfiable core [2020-11-29 19:41:31,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:41:31,143 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 142 [2020-11-29 19:41:31,145 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,187 INFO L625 ElimStorePlain]: treesize reduction 113, result has 13.1 percent of original size [2020-11-29 19:41:31,193 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2020-11-29 19:41:31,261 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2020-11-29 19:41:31,261 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:31,275 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2020-11-29 19:41:31,275 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:31,281 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,281 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:23 [2020-11-29 19:41:31,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:41:31,439 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 24 [2020-11-29 19:41:31,440 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:31,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:41:31,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 24 [2020-11-29 19:41:31,467 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,483 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:31,485 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,485 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:120, output treesize:19 [2020-11-29 19:41:31,529 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-11-29 19:41:31,530 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:31,541 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-11-29 19:41:31,541 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:41:31,547 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:41:31,547 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2020-11-29 19:41:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:41:31,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:41:31,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2020-11-29 19:41:31,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244098980] [2020-11-29 19:41:31,553 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:41:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash 102391059, now seen corresponding path program 2 times [2020-11-29 19:41:31,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:31,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221839862] [2020-11-29 19:41:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:31,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:31,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:31,563 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:31,725 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2020-11-29 19:41:31,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:41:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-29 19:41:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:41:31,804 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand 20 states. [2020-11-29 19:41:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:41:32,395 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-11-29 19:41:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:41:32,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2020-11-29 19:41:32,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-29 19:41:32,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2020-11-29 19:41:32,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-29 19:41:32,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-11-29 19:41:32,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2020-11-29 19:41:32,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:41:32,397 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-11-29 19:41:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2020-11-29 19:41:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-29 19:41:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-29 19:41:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-11-29 19:41:32,399 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-11-29 19:41:32,399 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-11-29 19:41:32,399 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 19:41:32,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2020-11-29 19:41:32,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-29 19:41:32,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:41:32,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:41:32,401 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:41:32,401 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:41:32,401 INFO L794 eck$LassoCheckResult]: Stem: 1903#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1877#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1878#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1894#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1895#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1896#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1905#L19-3 assume !(init_~i~0 < 2); 1899#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1874#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1872#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1873#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1884#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1885#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1888#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1889#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1902#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1879#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1880#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1897#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1882#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1883#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1904#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1901#L41 assume 1 == g_#t~mem12; 1898#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1890#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1886#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1887#L39 [2020-11-29 19:41:32,401 INFO L796 eck$LassoCheckResult]: Loop: 1887#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1900#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1906#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1887#L39 [2020-11-29 19:41:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash -147880128, now seen corresponding path program 2 times [2020-11-29 19:41:32,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:32,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403897957] [2020-11-29 19:41:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:32,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:32,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:32,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:32,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash 117220, now seen corresponding path program 5 times [2020-11-29 19:41:32,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:32,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057213492] [2020-11-29 19:41:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:32,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:41:32,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:41:32,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:41:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:41:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1139639877, now seen corresponding path program 1 times [2020-11-29 19:41:32,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:41:32,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358793906] [2020-11-29 19:41:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:41:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 19:41:32,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358793906] [2020-11-29 19:41:32,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805654564] [2020-11-29 19:41:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb2fd28-3c18-47a9-97ed-dadd275437c0/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:41:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:41:32,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:41:32,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:41:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 19:41:32,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:41:32,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-11-29 19:41:32,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294776364] [2020-11-29 19:41:32,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:41:32,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:41:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:41:32,695 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-11-29 19:41:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:41:32,743 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-11-29 19:41:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:41:32,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2020-11-29 19:41:32,744 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:41:32,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-11-29 19:41:32,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 19:41:32,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 19:41:32,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 19:41:32,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:41:32,745 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:41:32,745 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:41:32,745 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:41:32,745 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 19:41:32,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 19:41:32,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:41:32,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 19:41:32,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 07:41:32 BoogieIcfgContainer [2020-11-29 19:41:32,749 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 19:41:32,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:41:32,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:41:32,750 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:41:32,750 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:19" (3/4) ... [2020-11-29 19:41:32,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 19:41:32,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:41:32,753 INFO L168 Benchmark]: Toolchain (without parser) took 194022.87 ms. Allocated memory was 102.8 MB in the beginning and 224.4 MB in the end (delta: 121.6 MB). Free memory was 76.8 MB in the beginning and 78.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 119.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:41:32,754 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 102.8 MB. Free memory is still 61.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:41:32,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.50 ms. Allocated memory is still 102.8 MB. Free memory was 76.7 MB in the beginning and 79.1 MB in the end (delta: -2.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:41:32,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 102.8 MB. Free memory was 78.9 MB in the beginning and 77.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:41:32,755 INFO L168 Benchmark]: Boogie Preprocessor took 31.87 ms. Allocated memory is still 102.8 MB. Free memory was 77.0 MB in the beginning and 75.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:41:32,755 INFO L168 Benchmark]: RCFGBuilder took 728.54 ms. Allocated memory is still 102.8 MB. Free memory was 75.4 MB in the beginning and 52.2 MB in the end (delta: 23.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:41:32,755 INFO L168 Benchmark]: BuchiAutomizer took 192947.94 ms. Allocated memory was 102.8 MB in the beginning and 224.4 MB in the end (delta: 121.6 MB). Free memory was 52.2 MB in the beginning and 79.8 MB in the end (delta: -27.6 MB). Peak memory consumption was 98.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:41:32,756 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 224.4 MB. Free memory was 79.8 MB in the beginning and 78.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:41:32,758 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.82 ms. Allocated memory is still 102.8 MB. Free memory is still 61.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 264.50 ms. Allocated memory is still 102.8 MB. Free memory was 76.7 MB in the beginning and 79.1 MB in the end (delta: -2.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 102.8 MB. Free memory was 78.9 MB in the beginning and 77.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.87 ms. Allocated memory is still 102.8 MB. Free memory was 77.0 MB in the beginning and 75.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 728.54 ms. Allocated memory is still 102.8 MB. Free memory was 75.4 MB in the beginning and 52.2 MB in the end (delta: 23.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 192947.94 ms. Allocated memory was 102.8 MB in the beginning and 224.4 MB in the end (delta: 121.6 MB). Free memory was 52.2 MB in the beginning and 79.8 MB in the end (delta: -27.6 MB). Peak memory consumption was 98.2 MB. Max. memory is 16.1 GB. * Witness Printer took 3.32 ms. Allocated memory is still 224.4 MB. Free memory was 79.8 MB in the beginning and 78.8 MB in the end (delta: 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 * unknown-#length-unknown[pp] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 192.8s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 178.4s. Construction of modules took 1.4s. Büchi inclusion checks took 12.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 289 SDtfs, 769 SDslu, 816 SDs, 0 SdLazy, 1191 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1576 mio100 ax100 hnf99 lsp97 ukn24 mio100 lsp38 div100 bol100 ite100 ukn100 eq179 hnf82 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 104ms VariablesStem: 8 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...